/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/egcd3-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:49:09,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:49:09,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:49:09,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:49:09,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:49:09,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:49:09,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:49:09,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:49:09,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:49:09,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:49:09,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:49:09,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:49:09,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:49:09,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:49:09,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:49:09,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:49:09,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:49:09,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:49:09,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:49:09,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:49:09,825 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:49:09,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:49:09,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:49:09,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:49:09,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:49:09,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:49:09,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:49:09,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:49:09,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:49:09,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:49:09,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:49:09,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:49:09,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:49:09,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:49:09,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:49:09,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:49:09,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:49:09,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:49:09,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:49:09,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:49:09,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:49:09,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:49:09,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:49:09,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:49:09,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:49:09,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:49:09,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:49:09,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:49:09,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:49:09,858 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 05:49:10,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:49:10,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:49:10,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:49:10,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:49:10,022 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:49:10,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-28 05:49:10,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d976478/77c23845ce3b4846946cd6350d6c76f1/FLAG8fd884848 [2022-04-28 05:49:10,427 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:49:10,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-28 05:49:10,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d976478/77c23845ce3b4846946cd6350d6c76f1/FLAG8fd884848 [2022-04-28 05:49:10,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d976478/77c23845ce3b4846946cd6350d6c76f1 [2022-04-28 05:49:10,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:49:10,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:49:10,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:49:10,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:49:10,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:49:10,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:49:10" (1/1) ... [2022-04-28 05:49:10,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596e673d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:10, skipping insertion in model container [2022-04-28 05:49:10,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:49:10" (1/1) ... [2022-04-28 05:49:10,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:49:10,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:49:10,981 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/egcd3-ll_unwindbound10.c[490,503] [2022-04-28 05:49:10,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:49:11,001 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:49:11,008 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/egcd3-ll_unwindbound10.c[490,503] [2022-04-28 05:49:11,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:49:11,024 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:49:11,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11 WrapperNode [2022-04-28 05:49:11,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:49:11,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:49:11,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:49:11,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:49:11,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:49:11,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:49:11,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:49:11,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:49:11,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (1/1) ... [2022-04-28 05:49:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:49:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:11,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 05:49:11,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 05:49:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:49:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:49:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:49:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:49:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:49:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:49:11,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:49:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:49:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:49:11,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:49:11,152 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:49:11,153 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:49:11,298 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:49:11,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:49:11,303 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:49:11,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:49:11 BoogieIcfgContainer [2022-04-28 05:49:11,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:49:11,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:49:11,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:49:11,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:49:11,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:49:10" (1/3) ... [2022-04-28 05:49:11,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11457e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:49:11, skipping insertion in model container [2022-04-28 05:49:11,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:49:11" (2/3) ... [2022-04-28 05:49:11,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11457e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:49:11, skipping insertion in model container [2022-04-28 05:49:11,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:49:11" (3/3) ... [2022-04-28 05:49:11,311 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound10.c [2022-04-28 05:49:11,320 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:49:11,320 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:49:11,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:49:11,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ef3fcfc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@759ec053 [2022-04-28 05:49:11,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:49:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 05:49:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 05:49:11,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:11,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:11,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-28 05:49:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:11,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287382600] [2022-04-28 05:49:11,391 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 2 times [2022-04-28 05:49:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:11,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041530926] [2022-04-28 05:49:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:49:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:11,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(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; {43#true} is VALID [2022-04-28 05:49:11,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:49:11,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 05:49:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:49:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:11,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:49:11,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:49:11,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:49:11,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 05:49:11,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 05:49:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:11,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:49:11,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:49:11,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:49:11,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 05:49:11,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 05:49:11,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(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; {43#true} is VALID [2022-04-28 05:49:11,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:49:11,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 05:49:11,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-28 05:49:11,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;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; {43#true} is VALID [2022-04-28 05:49:11,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 05:49:11,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:49:11,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:49:11,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:49:11,518 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 05:49:11,518 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 05:49:11,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:49:11,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:49:11,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:49:11,519 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 05:49:11,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-28 05:49:11,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-28 05:49:11,520 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-28 05:49:11,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 05:49:11,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 05:49:11,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 05:49:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:11,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:11,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041530926] [2022-04-28 05:49:11,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041530926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:11,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:11,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:49:11,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:11,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287382600] [2022-04-28 05:49:11,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287382600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:11,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:11,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:49:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068940916] [2022-04-28 05:49:11,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:11,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 05:49:11,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:11,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:11,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:49:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:49:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:49:11,564 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:11,695 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-28 05:49:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:49:11,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 05:49:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 05:49:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 05:49:11,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-28 05:49:11,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:11,800 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:49:11,800 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 05:49:11,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:49:11,804 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:11,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 05:49:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 05:49:11,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:11,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:11,825 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:11,826 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:11,829 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 05:49:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 05:49:11,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:11,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:11,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 05:49:11,830 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 05:49:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:11,833 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 05:49:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 05:49:11,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:11,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:11,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-28 05:49:11,837 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-28 05:49:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:11,837 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-28 05:49:11,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:11,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 45 transitions. [2022-04-28 05:49:11,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-28 05:49:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:49:11,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:11,874 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:11,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:49:11,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:11,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-28 05:49:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:11,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [916486350] [2022-04-28 05:49:11,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 2 times [2022-04-28 05:49:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:11,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757936054] [2022-04-28 05:49:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:11,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:11,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274531539] [2022-04-28 05:49:11,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:11,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:11,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:49:11,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:49:11,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:11,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:49:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:11,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:12,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2022-04-28 05:49:12,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#(<= ~counter~0 0)} {349#true} #108#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#(<= ~counter~0 0)} call #t~ret9 := main(); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(<= ~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;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; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #94#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,066 INFO L272 TraceCheckUtils]: 11: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #96#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {357#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:12,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {357#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {406#(<= |main_#t~post6| 0)} is VALID [2022-04-28 05:49:12,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {350#false} is VALID [2022-04-28 05:49:12,085 INFO L272 TraceCheckUtils]: 19: Hoare triple {350#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {350#false} is VALID [2022-04-28 05:49:12,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} ~cond := #in~cond; {350#false} is VALID [2022-04-28 05:49:12,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {350#false} assume 0 == ~cond; {350#false} is VALID [2022-04-28 05:49:12,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-04-28 05:49:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:12,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:12,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757936054] [2022-04-28 05:49:12,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274531539] [2022-04-28 05:49:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274531539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:12,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:12,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:49:12,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [916486350] [2022-04-28 05:49:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [916486350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:12,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:12,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:49:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577355238] [2022-04-28 05:49:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:12,088 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:49:12,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:12,089 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:12,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:12,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:49:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:49:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:49:12,103 INFO L87 Difference]: Start difference. First operand 35 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:12,171 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 05:49:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:49:12,171 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:49:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:12,172 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 05:49:12,173 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 05:49:12,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-28 05:49:12,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:12,210 INFO L225 Difference]: With dead ends: 44 [2022-04-28 05:49:12,210 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 05:49:12,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:49:12,211 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:12,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 05:49:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 05:49:12,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:12,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:12,222 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:12,222 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:12,224 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 05:49:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 05:49:12,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:12,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:12,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-28 05:49:12,226 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-28 05:49:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:12,227 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 05:49:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 05:49:12,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:12,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:12,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:12,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 05:49:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 05:49:12,229 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-28 05:49:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:12,230 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 05:49:12,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:12,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 05:49:12,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 05:49:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 05:49:12,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:12,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:12,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:12,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:12,481 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-28 05:49:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:12,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975989120] [2022-04-28 05:49:12,482 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 2 times [2022-04-28 05:49:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:12,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844221524] [2022-04-28 05:49:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:12,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427085682] [2022-04-28 05:49:12,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:12,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:12,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:12,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:12,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:49:12,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:49:12,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:12,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:49:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:12,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:12,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {657#true} is VALID [2022-04-28 05:49:12,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {657#true} is VALID [2022-04-28 05:49:12,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 05:49:12,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#true} {657#true} #108#return; {657#true} is VALID [2022-04-28 05:49:12,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#true} call #t~ret9 := main(); {657#true} is VALID [2022-04-28 05:49:12,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#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;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; {657#true} is VALID [2022-04-28 05:49:12,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {657#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {657#true} is VALID [2022-04-28 05:49:12,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 05:49:12,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 05:49:12,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 05:49:12,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#true} {657#true} #94#return; {657#true} is VALID [2022-04-28 05:49:12,762 INFO L272 TraceCheckUtils]: 11: Hoare triple {657#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {657#true} is VALID [2022-04-28 05:49:12,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 05:49:12,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 05:49:12,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 05:49:12,762 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {657#true} {657#true} #96#return; {657#true} is VALID [2022-04-28 05:49:12,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {657#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:12,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {710#(and (= main_~r~0 0) (= 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; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:12,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(and (= main_~r~0 0) (= 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; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:12,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(and (= main_~r~0 0) (= 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); {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:12,765 INFO L272 TraceCheckUtils]: 20: Hoare triple {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:12,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:12,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {658#false} is VALID [2022-04-28 05:49:12,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {658#false} assume !false; {658#false} is VALID [2022-04-28 05:49:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:12,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844221524] [2022-04-28 05:49:12,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:12,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427085682] [2022-04-28 05:49:12,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427085682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:12,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:12,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:49:12,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:12,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975989120] [2022-04-28 05:49:12,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975989120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:12,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:12,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:49:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757923774] [2022-04-28 05:49:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 05:49:12,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:12,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:12,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:12,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:49:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:49:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:49:12,784 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:13,037 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-28 05:49:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:49:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 05:49:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 05:49:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 05:49:13,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 05:49:13,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:13,107 INFO L225 Difference]: With dead ends: 57 [2022-04-28 05:49:13,107 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 05:49:13,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:49:13,114 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:13,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 169 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:49:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 05:49:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 05:49:13,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:13,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,135 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,135 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:13,139 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 05:49:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 05:49:13,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:13,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:13,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-04-28 05:49:13,144 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-04-28 05:49:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:13,150 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 05:49:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 05:49:13,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:13,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:13,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:13,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-04-28 05:49:13,152 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 24 [2022-04-28 05:49:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:13,152 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-04-28 05:49:13,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:13,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 70 transitions. [2022-04-28 05:49:13,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-28 05:49:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 05:49:13,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:13,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:13,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:13,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 05:49:13,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-28 05:49:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1098463274] [2022-04-28 05:49:13,457 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 2 times [2022-04-28 05:49:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:13,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260410513] [2022-04-28 05:49:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:13,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:13,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200462984] [2022-04-28 05:49:13,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:13,471 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:13,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:49:13,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:13,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:13,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:49:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:13,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:13,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-28 05:49:13,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #108#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret9 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~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;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; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,653 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #94#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,658 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #96#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:13,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:13,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:13,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:13,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1133#(<= |main_#t~post7| 1)} is VALID [2022-04-28 05:49:13,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1067#false} is VALID [2022-04-28 05:49:13,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {1067#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; {1067#false} is VALID [2022-04-28 05:49:13,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1067#false} is VALID [2022-04-28 05:49:13,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#false} assume !(#t~post6 < 10);havoc #t~post6; {1067#false} is VALID [2022-04-28 05:49:13,660 INFO L272 TraceCheckUtils]: 25: Hoare triple {1067#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1067#false} is VALID [2022-04-28 05:49:13,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-28 05:49:13,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-28 05:49:13,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-28 05:49:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:13,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:13,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260410513] [2022-04-28 05:49:13,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:13,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200462984] [2022-04-28 05:49:13,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200462984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:13,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:13,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:13,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:13,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1098463274] [2022-04-28 05:49:13,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1098463274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:13,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:13,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:13,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482579939] [2022-04-28 05:49:13,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:13,662 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 05:49:13,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:13,663 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:13,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:13,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:49:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:49:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:49:13,679 INFO L87 Difference]: Start difference. First operand 53 states and 70 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:13,801 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-28 05:49:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:49:13,801 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 05:49:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 05:49:13,803 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 05:49:13,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 05:49:13,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:13,865 INFO L225 Difference]: With dead ends: 77 [2022-04-28 05:49:13,866 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 05:49:13,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:49:13,867 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:13,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 05:49:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 05:49:13,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:13,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,888 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,888 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:13,892 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 05:49:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 05:49:13,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:13,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:13,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-28 05:49:13,894 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-28 05:49:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:13,897 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 05:49:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 05:49:13,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:13,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:13,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:13,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-28 05:49:13,909 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-28 05:49:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:13,909 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-28 05:49:13,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:13,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 72 transitions. [2022-04-28 05:49:13,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 05:49:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 05:49:13,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:13,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:13,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:14,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:14,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-28 05:49:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:14,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119476230] [2022-04-28 05:49:14,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 2 times [2022-04-28 05:49:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:14,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520568713] [2022-04-28 05:49:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:14,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:14,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380858831] [2022-04-28 05:49:14,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:14,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:14,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 05:49:14,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:14,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:14,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:49:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:14,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:14,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 05:49:14,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1539#(<= ~counter~0 0)} {1531#true} #108#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {1539#(<= ~counter~0 0)} call #t~ret9 := main(); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {1539#(<= ~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;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; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {1539#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1539#(<= ~counter~0 0)} {1539#(<= ~counter~0 0)} #94#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {1539#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,439 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1539#(<= ~counter~0 0)} {1539#(<= ~counter~0 0)} #96#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:14,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:14,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {1588#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:14,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {1588#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:14,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {1588#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:14,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {1598#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:14,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:14,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#(<= ~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; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:14,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {1598#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1611#(<= |main_#t~post6| 2)} is VALID [2022-04-28 05:49:14,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {1611#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1532#false} is VALID [2022-04-28 05:49:14,442 INFO L272 TraceCheckUtils]: 26: Hoare triple {1532#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1532#false} is VALID [2022-04-28 05:49:14,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 05:49:14,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 05:49:14,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 05:49:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:14,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:14,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 05:49:14,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 05:49:14,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 05:49:14,589 INFO L272 TraceCheckUtils]: 26: Hoare triple {1532#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1532#false} is VALID [2022-04-28 05:49:14,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1639#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1532#false} is VALID [2022-04-28 05:49:14,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {1643#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1639#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:49:14,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~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; {1643#(< ~counter~0 10)} is VALID [2022-04-28 05:49:14,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {1643#(< ~counter~0 10)} is VALID [2022-04-28 05:49:14,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {1643#(< ~counter~0 10)} is VALID [2022-04-28 05:49:14,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {1656#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1643#(< ~counter~0 10)} is VALID [2022-04-28 05:49:14,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {1656#(< ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1656#(< ~counter~0 9)} is VALID [2022-04-28 05:49:14,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {1656#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1656#(< ~counter~0 9)} is VALID [2022-04-28 05:49:14,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {1666#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1656#(< ~counter~0 9)} is VALID [2022-04-28 05:49:14,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {1666#(< ~counter~0 8)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1531#true} {1666#(< ~counter~0 8)} #96#return; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 05:49:14,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 05:49:14,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 05:49:14,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {1666#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1531#true} is VALID [2022-04-28 05:49:14,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1531#true} {1666#(< ~counter~0 8)} #94#return; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 05:49:14,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 05:49:14,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 05:49:14,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {1666#(< ~counter~0 8)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1531#true} is VALID [2022-04-28 05:49:14,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {1666#(< ~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;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; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {1666#(< ~counter~0 8)} call #t~ret9 := main(); {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1666#(< ~counter~0 8)} {1531#true} #108#return; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {1666#(< ~counter~0 8)} assume true; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {1666#(< ~counter~0 8)} is VALID [2022-04-28 05:49:14,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 05:49:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520568713] [2022-04-28 05:49:14,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380858831] [2022-04-28 05:49:14,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380858831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:14,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:14,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:49:14,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119476230] [2022-04-28 05:49:14,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119476230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:14,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:14,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:49:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002480411] [2022-04-28 05:49:14,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-04-28 05:49:14,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:14,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:14,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:14,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:49:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:49:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:49:14,615 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:14,736 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-04-28 05:49:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:49:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-04-28 05:49:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 05:49:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 05:49:14,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 05:49:14,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:14,777 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:49:14,777 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 05:49:14,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:49:14,778 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:14,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 05:49:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 05:49:14,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:14,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:14,795 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:14,795 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:14,797 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 05:49:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 05:49:14,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:14,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:14,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-28 05:49:14,797 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-28 05:49:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:14,799 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 05:49:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 05:49:14,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:14,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:14,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:14,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:49:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2022-04-28 05:49:14,801 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2022-04-28 05:49:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:14,801 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2022-04-28 05:49:14,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:14,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 77 transitions. [2022-04-28 05:49:14,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 05:49:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 05:49:14,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:14,852 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 05:49:14,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:15,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:15,084 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-28 05:49:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:15,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676433920] [2022-04-28 05:49:15,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 2 times [2022-04-28 05:49:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:15,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015630577] [2022-04-28 05:49:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:15,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:15,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525904848] [2022-04-28 05:49:15,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:15,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:15,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:15,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:15,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 05:49:15,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:15,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:15,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:49:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:15,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:15,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2022-04-28 05:49:15,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {2094#true} is VALID [2022-04-28 05:49:15,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 05:49:15,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #108#return; {2094#true} is VALID [2022-04-28 05:49:15,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret9 := main(); {2094#true} is VALID [2022-04-28 05:49:15,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#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;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; {2094#true} is VALID [2022-04-28 05:49:15,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {2094#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 05:49:15,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2094#true} ~cond := #in~cond; {2120#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:49:15,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2120#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:15,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:15,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} {2094#true} #94#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:15,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {2131#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 05:49:15,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#true} ~cond := #in~cond; {2094#true} is VALID [2022-04-28 05:49:15,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {2094#true} assume !(0 == ~cond); {2094#true} is VALID [2022-04-28 05:49:15,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 05:49:15,296 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2094#true} {2131#(<= 1 main_~x~0)} #96#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:15,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 05:49:15,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {2150#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 05:49:15,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 05:49:15,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(<= 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; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:15,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {2173#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:15,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {2173#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:15,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {2173#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2095#false} is VALID [2022-04-28 05:49:15,302 INFO L272 TraceCheckUtils]: 27: Hoare triple {2095#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2095#false} is VALID [2022-04-28 05:49:15,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2022-04-28 05:49:15,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2022-04-28 05:49:15,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2022-04-28 05:49:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 05:49:15,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:15,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2022-04-28 05:49:15,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2022-04-28 05:49:15,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2022-04-28 05:49:15,470 INFO L272 TraceCheckUtils]: 27: Hoare triple {2095#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2095#false} is VALID [2022-04-28 05:49:15,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {2173#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2095#false} is VALID [2022-04-28 05:49:15,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {2173#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:15,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {2173#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:15,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(<= 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; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:15,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 05:49:15,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 05:49:15,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {2150#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 05:49:15,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 05:49:15,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2094#true} {2131#(<= 1 main_~x~0)} #96#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:15,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 05:49:15,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {2094#true} assume !(0 == ~cond); {2094#true} is VALID [2022-04-28 05:49:15,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#true} ~cond := #in~cond; {2094#true} is VALID [2022-04-28 05:49:15,474 INFO L272 TraceCheckUtils]: 11: Hoare triple {2131#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 05:49:15,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} {2094#true} #94#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:15,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:15,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:15,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {2094#true} ~cond := #in~cond; {2264#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:49:15,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {2094#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#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;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; {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret9 := main(); {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #108#return; {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2022-04-28 05:49:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 05:49:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:15,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015630577] [2022-04-28 05:49:15,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:15,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525904848] [2022-04-28 05:49:15,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525904848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:15,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:15,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:49:15,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:15,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676433920] [2022-04-28 05:49:15,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676433920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:15,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:15,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:49:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737408219] [2022-04-28 05:49:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:15,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 05:49:15,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:15,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:15,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:15,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:49:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:49:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:49:15,492 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:16,105 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2022-04-28 05:49:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:49:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 05:49:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 05:49:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 05:49:16,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-28 05:49:16,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:16,217 INFO L225 Difference]: With dead ends: 138 [2022-04-28 05:49:16,217 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 05:49:16,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:49:16,218 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 115 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:16,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 298 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:49:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 05:49:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2022-04-28 05:49:16,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:16,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:16,308 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:16,308 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:16,312 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 05:49:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 05:49:16,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:16,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:16,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 131 states. [2022-04-28 05:49:16,313 INFO L87 Difference]: Start difference. First operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 131 states. [2022-04-28 05:49:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:16,317 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 05:49:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 05:49:16,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:16,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:16,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:16,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2022-04-28 05:49:16,321 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 31 [2022-04-28 05:49:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:16,321 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2022-04-28 05:49:16,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:16,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 122 transitions. [2022-04-28 05:49:16,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2022-04-28 05:49:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:49:16,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:16,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:16,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:16,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:16,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 1 times [2022-04-28 05:49:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:16,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635327413] [2022-04-28 05:49:16,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 2 times [2022-04-28 05:49:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:16,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227995268] [2022-04-28 05:49:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:16,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2095004068] [2022-04-28 05:49:16,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:16,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:16,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:49:16,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:16,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:16,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:49:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:16,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:16,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {3016#true} call ULTIMATE.init(); {3016#true} is VALID [2022-04-28 05:49:16,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {3016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {3024#(<= ~counter~0 0)} assume true; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3024#(<= ~counter~0 0)} {3016#true} #108#return; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {3024#(<= ~counter~0 0)} call #t~ret9 := main(); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {3024#(<= ~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;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; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,825 INFO L272 TraceCheckUtils]: 6: Hoare triple {3024#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#(<= ~counter~0 0)} ~cond := #in~cond; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {3024#(<= ~counter~0 0)} assume !(0 == ~cond); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {3024#(<= ~counter~0 0)} assume true; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3024#(<= ~counter~0 0)} {3024#(<= ~counter~0 0)} #94#return; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,826 INFO L272 TraceCheckUtils]: 11: Hoare triple {3024#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {3024#(<= ~counter~0 0)} ~cond := #in~cond; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {3024#(<= ~counter~0 0)} assume !(0 == ~cond); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {3024#(<= ~counter~0 0)} assume true; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,828 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3024#(<= ~counter~0 0)} {3024#(<= ~counter~0 0)} #96#return; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {3024#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:16,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {3024#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3073#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:16,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {3073#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3073#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:16,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {3073#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3073#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:16,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {3073#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3083#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:16,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {3083#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:16,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {3083#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3083#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:16,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {3083#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3093#(<= |main_#t~post8| 2)} is VALID [2022-04-28 05:49:16,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {3093#(<= |main_#t~post8| 2)} assume !(#t~post8 < 10);havoc #t~post8; {3017#false} is VALID [2022-04-28 05:49:16,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {3017#false} is VALID [2022-04-28 05:49:16,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {3017#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3017#false} is VALID [2022-04-28 05:49:16,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#false} assume !(#t~post7 < 10);havoc #t~post7; {3017#false} is VALID [2022-04-28 05:49:16,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#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; {3017#false} is VALID [2022-04-28 05:49:16,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {3017#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3017#false} is VALID [2022-04-28 05:49:16,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {3017#false} assume !(#t~post6 < 10);havoc #t~post6; {3017#false} is VALID [2022-04-28 05:49:16,836 INFO L272 TraceCheckUtils]: 31: Hoare triple {3017#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {3017#false} is VALID [2022-04-28 05:49:16,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {3017#false} ~cond := #in~cond; {3017#false} is VALID [2022-04-28 05:49:16,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {3017#false} assume 0 == ~cond; {3017#false} is VALID [2022-04-28 05:49:16,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {3017#false} assume !false; {3017#false} is VALID [2022-04-28 05:49:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:16,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:16,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:16,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227995268] [2022-04-28 05:49:16,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:16,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095004068] [2022-04-28 05:49:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095004068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:16,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:16,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:49:16,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:16,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635327413] [2022-04-28 05:49:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635327413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:16,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:16,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:49:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694236399] [2022-04-28 05:49:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:16,837 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-28 05:49:16,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:16,838 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:16,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:16,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:49:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:49:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:49:16,858 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:17,049 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2022-04-28 05:49:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:49:17,049 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-28 05:49:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:17,049 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 05:49:17,051 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 05:49:17,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-28 05:49:17,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:17,106 INFO L225 Difference]: With dead ends: 127 [2022-04-28 05:49:17,106 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 05:49:17,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:49:17,106 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:17,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 05:49:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-28 05:49:17,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:17,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:17,211 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:17,211 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:17,214 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 05:49:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 05:49:17,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:17,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:17,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 90 states. [2022-04-28 05:49:17,215 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 90 states. [2022-04-28 05:49:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:17,217 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 05:49:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 05:49:17,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:17,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:17,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:17,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 05:49:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2022-04-28 05:49:17,221 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 35 [2022-04-28 05:49:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:17,221 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2022-04-28 05:49:17,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:17,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 124 transitions. [2022-04-28 05:49:17,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 05:49:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 05:49:17,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:17,318 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:17,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:17,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:17,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:17,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:17,519 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 1 times [2022-04-28 05:49:17,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1595589896] [2022-04-28 05:49:17,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 2 times [2022-04-28 05:49:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541037018] [2022-04-28 05:49:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:17,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:17,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:17,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084209243] [2022-04-28 05:49:17,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:17,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:17,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:17,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:17,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:49:17,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:17,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:17,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:49:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:17,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:17,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3740#true} is VALID [2022-04-28 05:49:17,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {3748#(<= ~counter~0 0)} assume true; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3748#(<= ~counter~0 0)} {3740#true} #108#return; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {3748#(<= ~counter~0 0)} call #t~ret9 := main(); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {3748#(<= ~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;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; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {3748#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {3748#(<= ~counter~0 0)} ~cond := #in~cond; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {3748#(<= ~counter~0 0)} assume !(0 == ~cond); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {3748#(<= ~counter~0 0)} assume true; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3748#(<= ~counter~0 0)} {3748#(<= ~counter~0 0)} #94#return; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,907 INFO L272 TraceCheckUtils]: 11: Hoare triple {3748#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {3748#(<= ~counter~0 0)} ~cond := #in~cond; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {3748#(<= ~counter~0 0)} assume !(0 == ~cond); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(<= ~counter~0 0)} assume true; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,908 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3748#(<= ~counter~0 0)} {3748#(<= ~counter~0 0)} #96#return; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {3748#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:17,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {3748#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3797#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:17,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {3797#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3797#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:17,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {3797#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3797#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:17,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {3797#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3807#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:17,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {3807#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {3807#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:17,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {3807#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3807#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:17,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {3807#(<= ~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; {3807#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:17,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {3807#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3820#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:17,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {3820#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {3820#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:17,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {3820#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3820#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:17,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {3820#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3830#(<= |main_#t~post7| 3)} is VALID [2022-04-28 05:49:17,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {3741#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; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {3741#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {3741#false} assume !(#t~post6 < 10);havoc #t~post6; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L272 TraceCheckUtils]: 32: Hoare triple {3741#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-28 05:49:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:17,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:18,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-28 05:49:18,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-28 05:49:18,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-28 05:49:18,123 INFO L272 TraceCheckUtils]: 32: Hoare triple {3741#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {3741#false} is VALID [2022-04-28 05:49:18,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {3741#false} assume !(#t~post6 < 10);havoc #t~post6; {3741#false} is VALID [2022-04-28 05:49:18,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {3741#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3741#false} is VALID [2022-04-28 05:49:18,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {3741#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; {3741#false} is VALID [2022-04-28 05:49:18,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {3876#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {3741#false} is VALID [2022-04-28 05:49:18,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {3880#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3876#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:49:18,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {3880#(< ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3880#(< ~counter~0 10)} is VALID [2022-04-28 05:49:18,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {3880#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3880#(< ~counter~0 10)} is VALID [2022-04-28 05:49:18,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {3890#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3880#(< ~counter~0 10)} is VALID [2022-04-28 05:49:18,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {3890#(< ~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; {3890#(< ~counter~0 9)} is VALID [2022-04-28 05:49:18,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {3890#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {3890#(< ~counter~0 9)} is VALID [2022-04-28 05:49:18,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {3890#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {3890#(< ~counter~0 9)} is VALID [2022-04-28 05:49:18,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {3903#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3890#(< ~counter~0 9)} is VALID [2022-04-28 05:49:18,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {3903#(< ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3903#(< ~counter~0 8)} is VALID [2022-04-28 05:49:18,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {3903#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {3903#(< ~counter~0 8)} is VALID [2022-04-28 05:49:18,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {3913#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(< ~counter~0 8)} is VALID [2022-04-28 05:49:18,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {3913#(< ~counter~0 7)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,156 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3740#true} {3913#(< ~counter~0 7)} #96#return; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-28 05:49:18,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {3740#true} assume !(0 == ~cond); {3740#true} is VALID [2022-04-28 05:49:18,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {3740#true} ~cond := #in~cond; {3740#true} is VALID [2022-04-28 05:49:18,156 INFO L272 TraceCheckUtils]: 11: Hoare triple {3913#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3740#true} is VALID [2022-04-28 05:49:18,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3740#true} {3913#(< ~counter~0 7)} #94#return; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-28 05:49:18,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {3740#true} assume !(0 == ~cond); {3740#true} is VALID [2022-04-28 05:49:18,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {3740#true} ~cond := #in~cond; {3740#true} is VALID [2022-04-28 05:49:18,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {3913#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3740#true} is VALID [2022-04-28 05:49:18,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {3913#(< ~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;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; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {3913#(< ~counter~0 7)} call #t~ret9 := main(); {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3913#(< ~counter~0 7)} {3740#true} #108#return; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {3913#(< ~counter~0 7)} assume true; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {3913#(< ~counter~0 7)} is VALID [2022-04-28 05:49:18,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3740#true} is VALID [2022-04-28 05:49:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:18,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541037018] [2022-04-28 05:49:18,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084209243] [2022-04-28 05:49:18,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084209243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:18,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:18,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:49:18,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1595589896] [2022-04-28 05:49:18,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1595589896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:18,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:18,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:49:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180904062] [2022-04-28 05:49:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:18,161 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 05:49:18,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:18,161 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:18,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:18,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:49:18,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:18,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:49:18,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:49:18,184 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:18,482 INFO L93 Difference]: Finished difference Result 163 states and 227 transitions. [2022-04-28 05:49:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:49:18,482 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 05:49:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:18,483 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 05:49:18,484 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), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 05:49:18,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-04-28 05:49:18,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:18,554 INFO L225 Difference]: With dead ends: 163 [2022-04-28 05:49:18,554 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 05:49:18,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:49:18,555 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:18,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 180 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 05:49:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 05:49:18,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:18,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:49:18,684 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:49:18,684 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:49:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:18,687 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 05:49:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 05:49:18,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:18,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:18,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 05:49:18,687 INFO L87 Difference]: Start difference. First operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 05:49:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:18,690 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 05:49:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 05:49:18,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:18,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:18,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:18,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 05:49:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2022-04-28 05:49:18,694 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 36 [2022-04-28 05:49:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:18,694 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2022-04-28 05:49:18,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:18,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 147 transitions. [2022-04-28 05:49:18,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2022-04-28 05:49:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 05:49:18,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:18,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:18,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:19,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:19,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-28 05:49:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:19,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747973526] [2022-04-28 05:49:19,022 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 2 times [2022-04-28 05:49:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:19,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745725441] [2022-04-28 05:49:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:19,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:19,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017622364] [2022-04-28 05:49:19,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:19,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:19,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:19,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:19,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 05:49:19,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:19,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:19,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 05:49:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:19,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:19,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {4737#true} call ULTIMATE.init(); {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {4737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4737#true} {4737#true} #108#return; {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {4737#true} call #t~ret9 := main(); {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {4737#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;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; {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {4737#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 05:49:19,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {4737#true} ~cond := #in~cond; {4763#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:49:19,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {4763#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4767#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:19,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {4767#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4767#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:19,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4767#(not (= |assume_abort_if_not_#in~cond| 0))} {4737#true} #94#return; {4774#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:19,377 INFO L272 TraceCheckUtils]: 11: Hoare triple {4774#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 05:49:19,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {4737#true} ~cond := #in~cond; {4737#true} is VALID [2022-04-28 05:49:19,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {4737#true} assume !(0 == ~cond); {4737#true} is VALID [2022-04-28 05:49:19,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 05:49:19,377 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4737#true} {4774#(<= 1 main_~x~0)} #96#return; {4774#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:19,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {4793#(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; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {4793#(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; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {4793#(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; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {4793#(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; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:49:19,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~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; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post8 < 10);havoc #t~post8; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 05:49:19,384 INFO L272 TraceCheckUtils]: 32: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:19,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:19,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {4847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4738#false} is VALID [2022-04-28 05:49:19,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {4738#false} assume !false; {4738#false} is VALID [2022-04-28 05:49:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 05:49:19,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:19,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {4738#false} assume !false; {4738#false} is VALID [2022-04-28 05:49:19,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {4847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4738#false} is VALID [2022-04-28 05:49:19,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:19,587 INFO L272 TraceCheckUtils]: 32: Hoare triple {4863#(= 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)); {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:19,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {4891#(= 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; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:19,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {4737#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:19,592 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4737#true} {4737#true} #96#return; {4737#true} is VALID [2022-04-28 05:49:19,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {4737#true} assume !(0 == ~cond); {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {4737#true} ~cond := #in~cond; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {4737#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4737#true} {4737#true} #94#return; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {4737#true} assume !(0 == ~cond); {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {4737#true} ~cond := #in~cond; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {4737#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {4737#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;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; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {4737#true} call #t~ret9 := main(); {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4737#true} {4737#true} #108#return; {4737#true} is VALID [2022-04-28 05:49:19,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 05:49:19,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {4737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {4737#true} is VALID [2022-04-28 05:49:19,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {4737#true} call ULTIMATE.init(); {4737#true} is VALID [2022-04-28 05:49:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:19,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745725441] [2022-04-28 05:49:19,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:19,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017622364] [2022-04-28 05:49:19,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017622364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:19,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:19,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-28 05:49:19,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:19,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [747973526] [2022-04-28 05:49:19,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [747973526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:19,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:19,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:49:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704573073] [2022-04-28 05:49:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:19,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 05:49:19,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:19,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:19,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:19,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:49:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:19,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:49:19,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:49:19,622 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:20,350 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2022-04-28 05:49:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:49:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 05:49:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 05:49:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 05:49:20,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-28 05:49:20,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:20,425 INFO L225 Difference]: With dead ends: 154 [2022-04-28 05:49:20,425 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 05:49:20,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:49:20,426 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:20,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 326 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:49:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 05:49:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-04-28 05:49:20,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:20,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:20,583 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:20,583 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:20,586 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 05:49:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 05:49:20,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:20,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:20,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 152 states. [2022-04-28 05:49:20,587 INFO L87 Difference]: Start difference. First operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 152 states. [2022-04-28 05:49:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:20,589 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 05:49:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 05:49:20,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:20,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:20,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:20,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-04-28 05:49:20,593 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 36 [2022-04-28 05:49:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-04-28 05:49:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:20,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 202 transitions. [2022-04-28 05:49:20,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-04-28 05:49:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 05:49:20,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:20,759 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:20,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:20,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 05:49:20,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 3 times [2022-04-28 05:49:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252640642] [2022-04-28 05:49:20,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 4 times [2022-04-28 05:49:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308006372] [2022-04-28 05:49:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:20,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:20,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452646073] [2022-04-28 05:49:20,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:49:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:20,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:20,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 05:49:21,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:49:21,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:21,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:49:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:21,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:21,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {5875#true} call ULTIMATE.init(); {5875#true} is VALID [2022-04-28 05:49:21,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {5875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {5875#true} is VALID [2022-04-28 05:49:21,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {5875#true} assume true; {5875#true} is VALID [2022-04-28 05:49:21,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5875#true} {5875#true} #108#return; {5875#true} is VALID [2022-04-28 05:49:21,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {5875#true} call #t~ret9 := main(); {5875#true} is VALID [2022-04-28 05:49:21,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {5875#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;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; {5875#true} is VALID [2022-04-28 05:49:21,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {5875#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {5875#true} ~cond := #in~cond; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {5875#true} assume !(0 == ~cond); {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {5875#true} assume true; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5875#true} {5875#true} #94#return; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {5875#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {5875#true} ~cond := #in~cond; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {5875#true} assume !(0 == ~cond); {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {5875#true} assume true; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5875#true} {5875#true} #96#return; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {5875#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {5875#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {5875#true} assume !!(#t~post6 < 10);havoc #t~post6; {5875#true} is VALID [2022-04-28 05:49:21,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {5875#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5875#true} is VALID [2022-04-28 05:49:21,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {5875#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5875#true} is VALID [2022-04-28 05:49:21,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {5875#true} assume !!(#t~post7 < 10);havoc #t~post7; {5875#true} is VALID [2022-04-28 05:49:21,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {5875#true} assume !(~c~0 >= ~b~0); {5946#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:49:21,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {5946#(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; {5950#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:49:21,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {5950#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5950#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:49:21,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {5950#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5950#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:49:21,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {5950#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5960#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:49:21,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {5960#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5960#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {5960#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {5960#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {5960#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {5876#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; {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {5876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {5876#false} assume !(#t~post6 < 10);havoc #t~post6; {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L272 TraceCheckUtils]: 33: Hoare triple {5876#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {5876#false} ~cond := #in~cond; {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {5876#false} assume 0 == ~cond; {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {5876#false} assume !false; {5876#false} is VALID [2022-04-28 05:49:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:21,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:21,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308006372] [2022-04-28 05:49:21,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:21,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452646073] [2022-04-28 05:49:21,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452646073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:21,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:21,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:21,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:21,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252640642] [2022-04-28 05:49:21,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252640642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:21,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:21,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045199854] [2022-04-28 05:49:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 05:49:21,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:21,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:21,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:49:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:49:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:49:21,128 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:21,576 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2022-04-28 05:49:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:49:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 05:49:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 05:49:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 05:49:21,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-28 05:49:21,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:21,654 INFO L225 Difference]: With dead ends: 300 [2022-04-28 05:49:21,654 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 05:49:21,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:49:21,656 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:21,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 176 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 05:49:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 175. [2022-04-28 05:49:21,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:21,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:21,944 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:21,944 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:21,950 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 05:49:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 05:49:21,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:21,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:21,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 249 states. [2022-04-28 05:49:21,951 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 249 states. [2022-04-28 05:49:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:21,957 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 05:49:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 05:49:21,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:21,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:21,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:21,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 05:49:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-28 05:49:21,962 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 37 [2022-04-28 05:49:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:21,962 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-28 05:49:21,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:49:21,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-28 05:49:22,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-28 05:49:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 05:49:22,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:22,173 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:22,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:22,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 05:49:22,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-28 05:49:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:22,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144738918] [2022-04-28 05:49:22,374 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 2 times [2022-04-28 05:49:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:22,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144272721] [2022-04-28 05:49:22,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:22,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:22,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:22,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857909074] [2022-04-28 05:49:22,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:22,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:22,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 05:49:22,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:22,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:22,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:49:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:22,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:22,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {7443#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #108#return; {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {7443#true} call #t~ret9 := main(); {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {7443#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;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; {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {7443#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 05:49:22,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7443#true} {7443#true} #94#return; {7443#true} is VALID [2022-04-28 05:49:22,639 INFO L272 TraceCheckUtils]: 11: Hoare triple {7443#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7443#true} is VALID [2022-04-28 05:49:22,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {7443#true} ~cond := #in~cond; {7484#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:49:22,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {7484#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7488#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:22,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {7488#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7488#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:22,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7488#(not (= |assume_abort_if_not_#in~cond| 0))} {7443#true} #96#return; {7495#(<= 1 main_~y~0)} is VALID [2022-04-28 05:49:22,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {7495#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7499#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:22,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {7499#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7499#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:22,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {7499#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {7499#(<= 1 main_~b~0)} is VALID [2022-04-28 05:49:22,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {7499#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,643 INFO L272 TraceCheckUtils]: 25: Hoare triple {7509#(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)); {7443#true} is VALID [2022-04-28 05:49:22,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2022-04-28 05:49:22,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2022-04-28 05:49:22,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 05:49:22,644 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7443#true} {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #98#return; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,644 INFO L272 TraceCheckUtils]: 30: Hoare triple {7509#(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)); {7443#true} is VALID [2022-04-28 05:49:22,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2022-04-28 05:49:22,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2022-04-28 05:49:22,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 05:49:22,645 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7443#true} {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #100#return; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:49:22,645 INFO L272 TraceCheckUtils]: 35: Hoare triple {7509#(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)); {7558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:22,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {7558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:22,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {7562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7444#false} is VALID [2022-04-28 05:49:22,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2022-04-28 05:49:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 05:49:22,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144272721] [2022-04-28 05:49:22,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857909074] [2022-04-28 05:49:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857909074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:22,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:22,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:49:22,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:22,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144738918] [2022-04-28 05:49:22,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144738918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:22,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:22,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:49:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375598182] [2022-04-28 05:49:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 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 39 [2022-04-28 05:49:22,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:22,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:22,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:22,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:49:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:49:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:49:22,669 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:23,387 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2022-04-28 05:49:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:49:23,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 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 39 [2022-04-28 05:49:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 05:49:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 05:49:23,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2022-04-28 05:49:23,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:23,452 INFO L225 Difference]: With dead ends: 193 [2022-04-28 05:49:23,453 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 05:49:23,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:49:23,453 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:23,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:49:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 05:49:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2022-04-28 05:49:23,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:23,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:23,765 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:23,766 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:23,769 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 05:49:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 05:49:23,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:23,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:23,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 191 states. [2022-04-28 05:49:23,770 INFO L87 Difference]: Start difference. First operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 191 states. [2022-04-28 05:49:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:23,773 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 05:49:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 05:49:23,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:23,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:23,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:23,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2022-04-28 05:49:23,778 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 39 [2022-04-28 05:49:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:23,778 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2022-04-28 05:49:23,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:23,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 258 transitions. [2022-04-28 05:49:24,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2022-04-28 05:49:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:49:24,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:24,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:24,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:24,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 05:49:24,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-28 05:49:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074426425] [2022-04-28 05:49:24,206 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 2 times [2022-04-28 05:49:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:24,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777739725] [2022-04-28 05:49:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:24,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449134797] [2022-04-28 05:49:24,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:24,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:24,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 05:49:24,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:24,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:24,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 05:49:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:24,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:24,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {8724#true} call ULTIMATE.init(); {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {8724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8724#true} {8724#true} #108#return; {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {8724#true} call #t~ret9 := main(); {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {8724#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;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; {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {8724#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 05:49:24,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {8724#true} ~cond := #in~cond; {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:49:24,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:24,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:24,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} {8724#true} #94#return; {8761#(<= 1 main_~x~0)} is VALID [2022-04-28 05:49:24,709 INFO L272 TraceCheckUtils]: 11: Hoare triple {8761#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 05:49:24,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {8724#true} ~cond := #in~cond; {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:49:24,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:24,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:49:24,711 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} {8761#(<= 1 main_~x~0)} #96#return; {8777#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {8777#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~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; {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:24,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~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; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post8 < 10);havoc #t~post8; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,723 INFO L272 TraceCheckUtils]: 32: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8724#true} is VALID [2022-04-28 05:49:24,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 05:49:24,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 05:49:24,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 05:49:24,724 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8724#true} {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #98#return; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 05:49:24,724 INFO L272 TraceCheckUtils]: 37: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:24,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:24,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {8851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8725#false} is VALID [2022-04-28 05:49:24,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {8725#false} assume !false; {8725#false} is VALID [2022-04-28 05:49:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:24,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:24,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {8725#false} assume !false; {8725#false} is VALID [2022-04-28 05:49:24,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {8851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8725#false} is VALID [2022-04-28 05:49:24,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:24,991 INFO L272 TraceCheckUtils]: 37: Hoare triple {8867#(= 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)); {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:24,991 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8724#true} {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 05:49:24,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 05:49:24,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 05:49:24,992 INFO L272 TraceCheckUtils]: 32: Hoare triple {8867#(= 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)); {8724#true} is VALID [2022-04-28 05:49:24,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:24,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:49:26,996 WARN L290 TraceCheckUtils]: 23: Hoare triple {8910#(= (+ (* (+ (* (* main_~k~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; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:49:27,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {8910#(= (+ (* (+ (* (* main_~k~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); {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 05:49:27,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {8910#(= (+ (* (+ (* (* main_~k~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; {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 05:49:27,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {8910#(= (+ (* (+ (* (* main_~k~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; {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 05:49:27,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 05:49:27,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:27,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:27,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {8724#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:27,009 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8724#true} {8724#true} #96#return; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L272 TraceCheckUtils]: 11: Hoare triple {8724#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8724#true} {8724#true} #94#return; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {8724#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {8724#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;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; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {8724#true} call #t~ret9 := main(); {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8724#true} {8724#true} #108#return; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 05:49:27,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {8724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {8724#true} is VALID [2022-04-28 05:49:27,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {8724#true} call ULTIMATE.init(); {8724#true} is VALID [2022-04-28 05:49:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:27,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777739725] [2022-04-28 05:49:27,011 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:27,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449134797] [2022-04-28 05:49:27,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449134797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:27,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:27,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 05:49:27,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:27,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074426425] [2022-04-28 05:49:27,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074426425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:27,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:27,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:49:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753975145] [2022-04-28 05:49:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-28 05:49:27,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:27,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:49:27,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:27,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:49:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:49:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:49:27,041 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:49:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:27,980 INFO L93 Difference]: Finished difference Result 199 states and 266 transitions. [2022-04-28 05:49:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:49:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-28 05:49:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:49:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:49:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:49:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:49:27,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 05:49:28,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:28,087 INFO L225 Difference]: With dead ends: 199 [2022-04-28 05:49:28,087 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 05:49:28,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:49:28,088 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 104 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:28,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 310 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:49:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 05:49:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 05:49:28,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:28,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:28,295 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:28,295 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:28,300 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 05:49:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 05:49:28,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:28,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:28,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 197 states. [2022-04-28 05:49:28,301 INFO L87 Difference]: Start difference. First operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 197 states. [2022-04-28 05:49:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:28,306 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 05:49:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 05:49:28,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:28,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:28,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:28,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 05:49:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2022-04-28 05:49:28,310 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 41 [2022-04-28 05:49:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:28,311 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2022-04-28 05:49:28,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:49:28,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 261 transitions. [2022-04-28 05:49:28,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2022-04-28 05:49:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 05:49:28,561 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:28,561 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:28,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 05:49:28,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 05:49:28,762 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-28 05:49:28,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:28,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576439872] [2022-04-28 05:49:28,762 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 2 times [2022-04-28 05:49:28,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:28,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094285429] [2022-04-28 05:49:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:28,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:28,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307234916] [2022-04-28 05:49:28,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:28,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:28,781 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:28,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 05:49:28,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:28,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:28,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:49:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:28,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:28,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {10169#true} call ULTIMATE.init(); {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {10169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10169#true} {10169#true} #108#return; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {10169#true} call #t~ret9 := main(); {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {10169#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;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; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {10169#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10169#true} {10169#true} #94#return; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L272 TraceCheckUtils]: 11: Hoare triple {10169#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 05:49:28,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10169#true} {10169#true} #96#return; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {10169#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {10169#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {10169#true} assume !!(#t~post6 < 10);havoc #t~post6; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {10169#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {10169#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {10169#true} assume !!(#t~post7 < 10);havoc #t~post7; {10169#true} is VALID [2022-04-28 05:49:28,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {10169#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:49:28,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:49:28,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:49:28,955 INFO L272 TraceCheckUtils]: 25: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10169#true} is VALID [2022-04-28 05:49:28,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 05:49:28,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 05:49:28,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 05:49:28,956 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {10169#true} {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #98#return; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:49:28,956 INFO L272 TraceCheckUtils]: 30: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10169#true} is VALID [2022-04-28 05:49:28,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 05:49:28,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 05:49:28,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 05:49:28,957 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10169#true} {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #100#return; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:49:28,957 INFO L272 TraceCheckUtils]: 35: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10169#true} is VALID [2022-04-28 05:49:28,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 05:49:28,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 05:49:28,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 05:49:28,958 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10169#true} {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:49:28,959 INFO L272 TraceCheckUtils]: 40: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:28,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {10295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:28,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {10299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10170#false} is VALID [2022-04-28 05:49:28,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {10170#false} assume !false; {10170#false} is VALID [2022-04-28 05:49:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 05:49:28,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:28,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:28,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094285429] [2022-04-28 05:49:28,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:28,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307234916] [2022-04-28 05:49:28,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307234916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:28,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:28,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:28,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:28,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576439872] [2022-04-28 05:49:28,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576439872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:28,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:28,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043429678] [2022-04-28 05:49:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-28 05:49:28,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:28,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:49:28,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:28,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:49:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:49:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:49:28,986 INFO L87 Difference]: Start difference. First operand 194 states and 261 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:49:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:29,647 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2022-04-28 05:49:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:49:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-28 05:49:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:49:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:49:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:49:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:49:29,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 05:49:29,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:29,702 INFO L225 Difference]: With dead ends: 261 [2022-04-28 05:49:29,702 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 05:49:29,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:49:29,703 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:29,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 163 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 05:49:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2022-04-28 05:49:30,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:30,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 05:49:30,173 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 05:49:30,174 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 05:49:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:30,178 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 05:49:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 05:49:30,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:30,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:30,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 259 states. [2022-04-28 05:49:30,180 INFO L87 Difference]: Start difference. First operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 259 states. [2022-04-28 05:49:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:30,185 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 05:49:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 05:49:30,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:30,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:30,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:30,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 05:49:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2022-04-28 05:49:30,190 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 44 [2022-04-28 05:49:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:30,191 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2022-04-28 05:49:30,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:49:30,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 318 transitions. [2022-04-28 05:49:30,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2022-04-28 05:49:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 05:49:30,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:30,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:30,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:30,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 05:49:30,705 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 1 times [2022-04-28 05:49:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:30,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [503566442] [2022-04-28 05:49:30,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 2 times [2022-04-28 05:49:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:30,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664119380] [2022-04-28 05:49:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:30,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:30,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40676781] [2022-04-28 05:49:30,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:30,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:30,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:30,717 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:30,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 05:49:30,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:30,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:30,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:49:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:30,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:30,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {11803#true} call ULTIMATE.init(); {11803#true} is VALID [2022-04-28 05:49:30,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {11803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {11811#(<= ~counter~0 0)} assume true; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11811#(<= ~counter~0 0)} {11803#true} #108#return; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {11811#(<= ~counter~0 0)} call #t~ret9 := main(); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {11811#(<= ~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;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; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,979 INFO L272 TraceCheckUtils]: 6: Hoare triple {11811#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {11811#(<= ~counter~0 0)} ~cond := #in~cond; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(<= ~counter~0 0)} assume !(0 == ~cond); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {11811#(<= ~counter~0 0)} assume true; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11811#(<= ~counter~0 0)} {11811#(<= ~counter~0 0)} #94#return; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {11811#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {11811#(<= ~counter~0 0)} ~cond := #in~cond; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {11811#(<= ~counter~0 0)} assume !(0 == ~cond); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {11811#(<= ~counter~0 0)} assume true; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11811#(<= ~counter~0 0)} {11811#(<= ~counter~0 0)} #96#return; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {11811#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:30,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {11811#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11860#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:30,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {11860#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {11860#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:30,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {11860#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11860#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:30,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {11860#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11870#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:30,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {11870#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {11870#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:30,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {11870#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {11870#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:30,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {11870#(<= ~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; {11870#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:30,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {11870#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11883#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:30,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {11883#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {11883#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:30,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {11883#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11883#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:30,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {11883#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11893#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:30,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {11893#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {11893#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:30,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {11893#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11893#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:30,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {11893#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11903#(<= |main_#t~post8| 4)} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {11903#(<= |main_#t~post8| 4)} assume !(#t~post8 < 10);havoc #t~post8; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {11804#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {11804#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {11804#false} assume !(#t~post7 < 10);havoc #t~post7; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {11804#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; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {11804#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {11804#false} assume !(#t~post6 < 10);havoc #t~post6; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L272 TraceCheckUtils]: 38: Hoare triple {11804#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {11804#false} ~cond := #in~cond; {11804#false} is VALID [2022-04-28 05:49:30,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {11804#false} assume 0 == ~cond; {11804#false} is VALID [2022-04-28 05:49:30,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {11804#false} assume !false; {11804#false} is VALID [2022-04-28 05:49:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:30,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:31,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {11804#false} assume !false; {11804#false} is VALID [2022-04-28 05:49:31,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {11804#false} assume 0 == ~cond; {11804#false} is VALID [2022-04-28 05:49:31,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {11804#false} ~cond := #in~cond; {11804#false} is VALID [2022-04-28 05:49:31,241 INFO L272 TraceCheckUtils]: 38: Hoare triple {11804#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {11804#false} is VALID [2022-04-28 05:49:31,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {11804#false} assume !(#t~post6 < 10);havoc #t~post6; {11804#false} is VALID [2022-04-28 05:49:31,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {11804#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11804#false} is VALID [2022-04-28 05:49:31,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {11804#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; {11804#false} is VALID [2022-04-28 05:49:31,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {11804#false} assume !(#t~post7 < 10);havoc #t~post7; {11804#false} is VALID [2022-04-28 05:49:31,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {11804#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11804#false} is VALID [2022-04-28 05:49:31,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {11804#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11804#false} is VALID [2022-04-28 05:49:31,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {11967#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {11804#false} is VALID [2022-04-28 05:49:31,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {11971#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11967#(< |main_#t~post8| 10)} is VALID [2022-04-28 05:49:31,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {11971#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11971#(< ~counter~0 10)} is VALID [2022-04-28 05:49:31,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {11971#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {11971#(< ~counter~0 10)} is VALID [2022-04-28 05:49:31,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {11981#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11971#(< ~counter~0 10)} is VALID [2022-04-28 05:49:31,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {11981#(< ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11981#(< ~counter~0 9)} is VALID [2022-04-28 05:49:31,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {11981#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {11981#(< ~counter~0 9)} is VALID [2022-04-28 05:49:31,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {11991#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11981#(< ~counter~0 9)} is VALID [2022-04-28 05:49:31,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#(< ~counter~0 8)} ~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; {11991#(< ~counter~0 8)} is VALID [2022-04-28 05:49:31,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {11991#(< ~counter~0 8)} assume !(~c~0 >= ~b~0); {11991#(< ~counter~0 8)} is VALID [2022-04-28 05:49:31,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {11991#(< ~counter~0 8)} is VALID [2022-04-28 05:49:31,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {12004#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11991#(< ~counter~0 8)} is VALID [2022-04-28 05:49:31,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {12004#(< ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12004#(< ~counter~0 7)} is VALID [2022-04-28 05:49:31,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {12004#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {12004#(< ~counter~0 7)} is VALID [2022-04-28 05:49:31,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {12014#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12004#(< ~counter~0 7)} is VALID [2022-04-28 05:49:31,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {12014#(< ~counter~0 6)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,247 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11803#true} {12014#(< ~counter~0 6)} #96#return; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {11803#true} assume true; {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {11803#true} assume !(0 == ~cond); {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {11803#true} ~cond := #in~cond; {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L272 TraceCheckUtils]: 11: Hoare triple {12014#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11803#true} {12014#(< ~counter~0 6)} #94#return; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {11803#true} assume true; {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {11803#true} assume !(0 == ~cond); {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {11803#true} ~cond := #in~cond; {11803#true} is VALID [2022-04-28 05:49:31,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {12014#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11803#true} is VALID [2022-04-28 05:49:31,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {12014#(< ~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;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; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {12014#(< ~counter~0 6)} call #t~ret9 := main(); {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12014#(< ~counter~0 6)} {11803#true} #108#return; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {12014#(< ~counter~0 6)} assume true; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {11803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {12014#(< ~counter~0 6)} is VALID [2022-04-28 05:49:31,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {11803#true} call ULTIMATE.init(); {11803#true} is VALID [2022-04-28 05:49:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:49:31,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664119380] [2022-04-28 05:49:31,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40676781] [2022-04-28 05:49:31,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40676781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:31,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:31,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:49:31,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:31,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [503566442] [2022-04-28 05:49:31,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [503566442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:31,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:31,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:49:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380645769] [2022-04-28 05:49:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:31,252 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-04-28 05:49:31,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:31,252 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:31,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:31,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:49:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:49:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:49:31,279 INFO L87 Difference]: Start difference. First operand 228 states and 318 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:31,970 INFO L93 Difference]: Finished difference Result 429 states and 607 transitions. [2022-04-28 05:49:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:49:31,970 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-04-28 05:49:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:31,970 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 05:49:31,972 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 05:49:31,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 132 transitions. [2022-04-28 05:49:32,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:32,062 INFO L225 Difference]: With dead ends: 429 [2022-04-28 05:49:32,062 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 05:49:32,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:49:32,063 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:32,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 05:49:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258. [2022-04-28 05:49:32,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:32,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 05:49:32,420 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 05:49:32,420 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 05:49:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:32,425 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 05:49:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 05:49:32,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:32,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:32,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 264 states. [2022-04-28 05:49:32,426 INFO L87 Difference]: Start difference. First operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 264 states. [2022-04-28 05:49:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:32,431 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 05:49:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 05:49:32,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:32,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:32,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:32,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 05:49:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 351 transitions. [2022-04-28 05:49:32,438 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 351 transitions. Word has length 42 [2022-04-28 05:49:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:32,438 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 351 transitions. [2022-04-28 05:49:32,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:49:32,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 351 transitions. [2022-04-28 05:49:32,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 351 transitions. [2022-04-28 05:49:32,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 05:49:32,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:32,790 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:32,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 05:49:32,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 05:49:32,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:32,991 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 1 times [2022-04-28 05:49:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:32,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [646296352] [2022-04-28 05:49:32,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:32,992 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 2 times [2022-04-28 05:49:32,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:32,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445882335] [2022-04-28 05:49:32,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:33,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:33,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041495630] [2022-04-28 05:49:33,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:33,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:33,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:33,016 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:33,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 05:49:33,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:33,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:33,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:49:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:33,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:34,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {13974#true} call ULTIMATE.init(); {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {13974#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13974#true} {13974#true} #108#return; {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {13974#true} call #t~ret9 := main(); {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {13974#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;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; {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {13974#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 05:49:34,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13974#true} {13974#true} #94#return; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L272 TraceCheckUtils]: 11: Hoare triple {13974#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13974#true} {13974#true} #96#return; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {13974#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {13974#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {13974#true} assume !!(#t~post6 < 10);havoc #t~post6; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {13974#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {13974#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#true} assume !!(#t~post7 < 10);havoc #t~post7; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {13974#true} assume !(~c~0 >= ~b~0); {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {13974#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; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {13974#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13974#true} is VALID [2022-04-28 05:49:34,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {13974#true} assume !!(#t~post6 < 10);havoc #t~post6; {13974#true} is VALID [2022-04-28 05:49:34,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {13974#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post8 < 10);havoc #t~post8; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,337 INFO L272 TraceCheckUtils]: 32: Hoare triple {14057#(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)); {13974#true} is VALID [2022-04-28 05:49:34,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 05:49:34,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 05:49:34,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 05:49:34,338 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13974#true} {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #98#return; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,338 INFO L272 TraceCheckUtils]: 37: Hoare triple {14057#(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)); {13974#true} is VALID [2022-04-28 05:49:34,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 05:49:34,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 05:49:34,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 05:49:34,339 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13974#true} {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #100#return; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:49:34,340 INFO L272 TraceCheckUtils]: 42: Hoare triple {14057#(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)); {14106#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:34,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {14106#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14110#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:34,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {14110#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13975#false} is VALID [2022-04-28 05:49:34,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {13975#false} assume !false; {13975#false} is VALID [2022-04-28 05:49:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 05:49:34,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:49:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:34,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445882335] [2022-04-28 05:49:34,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:34,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041495630] [2022-04-28 05:49:34,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041495630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:34,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:34,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:34,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:34,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [646296352] [2022-04-28 05:49:34,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [646296352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:34,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:34,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:49:34,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458855398] [2022-04-28 05:49:34,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:34,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-28 05:49:34,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:34,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:34,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:34,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:49:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:49:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:49:34,387 INFO L87 Difference]: Start difference. First operand 258 states and 351 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:35,024 INFO L93 Difference]: Finished difference Result 332 states and 473 transitions. [2022-04-28 05:49:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:49:35,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-28 05:49:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:49:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:49:35,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 05:49:35,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:35,080 INFO L225 Difference]: With dead ends: 332 [2022-04-28 05:49:35,080 INFO L226 Difference]: Without dead ends: 330 [2022-04-28 05:49:35,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:49:35,083 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:35,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:49:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-28 05:49:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 321. [2022-04-28 05:49:35,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:35,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:35,766 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:35,767 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:35,774 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 05:49:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 05:49:35,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:35,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:35,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 330 states. [2022-04-28 05:49:35,776 INFO L87 Difference]: Start difference. First operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 330 states. [2022-04-28 05:49:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:35,783 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 05:49:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 05:49:35,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:35,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:35,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:35,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 462 transitions. [2022-04-28 05:49:35,792 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 462 transitions. Word has length 46 [2022-04-28 05:49:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:35,792 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 462 transitions. [2022-04-28 05:49:35,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:49:35,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 462 transitions. [2022-04-28 05:49:36,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 462 transitions. [2022-04-28 05:49:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 05:49:36,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:36,336 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:36,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:36,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:36,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 1 times [2022-04-28 05:49:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676268880] [2022-04-28 05:49:36,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 2 times [2022-04-28 05:49:36,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:36,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400966966] [2022-04-28 05:49:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:36,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:36,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976604897] [2022-04-28 05:49:36,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:36,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:36,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:36,555 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:36,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 05:49:36,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:36,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:36,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:49:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:36,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:36,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {16084#true} call ULTIMATE.init(); {16084#true} is VALID [2022-04-28 05:49:36,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {16084#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {16092#(<= ~counter~0 0)} assume true; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16092#(<= ~counter~0 0)} {16084#true} #108#return; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {16092#(<= ~counter~0 0)} call #t~ret9 := main(); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {16092#(<= ~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;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; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {16092#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {16092#(<= ~counter~0 0)} ~cond := #in~cond; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {16092#(<= ~counter~0 0)} assume !(0 == ~cond); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {16092#(<= ~counter~0 0)} assume true; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16092#(<= ~counter~0 0)} {16092#(<= ~counter~0 0)} #94#return; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {16092#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(<= ~counter~0 0)} ~cond := #in~cond; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {16092#(<= ~counter~0 0)} assume !(0 == ~cond); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {16092#(<= ~counter~0 0)} assume true; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16092#(<= ~counter~0 0)} {16092#(<= ~counter~0 0)} #96#return; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {16092#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 05:49:36,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {16092#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16141#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:36,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {16141#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {16141#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:36,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {16141#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16141#(<= ~counter~0 1)} is VALID [2022-04-28 05:49:36,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {16141#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16151#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:36,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {16151#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {16151#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:36,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {16151#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16151#(<= ~counter~0 2)} is VALID [2022-04-28 05:49:36,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {16151#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {16161#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,882 INFO L272 TraceCheckUtils]: 25: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,883 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #98#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,884 INFO L272 TraceCheckUtils]: 30: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,885 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #100#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,886 INFO L272 TraceCheckUtils]: 35: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,887 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #102#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,887 INFO L272 TraceCheckUtils]: 40: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,889 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #104#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {16161#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {16161#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 05:49:36,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {16161#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16234#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:36,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {16234#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {16234#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:36,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {16234#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {16234#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:36,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {16234#(<= ~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; {16234#(<= ~counter~0 4)} is VALID [2022-04-28 05:49:36,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {16234#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16247#(<= |main_#t~post6| 4)} is VALID [2022-04-28 05:49:36,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {16247#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {16085#false} is VALID [2022-04-28 05:49:36,891 INFO L272 TraceCheckUtils]: 53: Hoare triple {16085#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {16085#false} is VALID [2022-04-28 05:49:36,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {16085#false} ~cond := #in~cond; {16085#false} is VALID [2022-04-28 05:49:36,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {16085#false} assume 0 == ~cond; {16085#false} is VALID [2022-04-28 05:49:36,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {16085#false} assume !false; {16085#false} is VALID [2022-04-28 05:49:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:49:36,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:37,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {16085#false} assume !false; {16085#false} is VALID [2022-04-28 05:49:37,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {16085#false} assume 0 == ~cond; {16085#false} is VALID [2022-04-28 05:49:37,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {16085#false} ~cond := #in~cond; {16085#false} is VALID [2022-04-28 05:49:37,183 INFO L272 TraceCheckUtils]: 53: Hoare triple {16085#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {16085#false} is VALID [2022-04-28 05:49:37,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {16275#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {16085#false} is VALID [2022-04-28 05:49:37,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {16279#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16275#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:49:37,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {16279#(< ~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; {16279#(< ~counter~0 10)} is VALID [2022-04-28 05:49:37,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {16279#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {16279#(< ~counter~0 10)} is VALID [2022-04-28 05:49:37,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {16279#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {16279#(< ~counter~0 10)} is VALID [2022-04-28 05:49:37,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {16292#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16279#(< ~counter~0 10)} is VALID [2022-04-28 05:49:37,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {16292#(< ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {16292#(< ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,186 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #104#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 05:49:37,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 05:49:37,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 05:49:37,186 INFO L272 TraceCheckUtils]: 40: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 05:49:37,187 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #102#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 05:49:37,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 05:49:37,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 05:49:37,187 INFO L272 TraceCheckUtils]: 35: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 05:49:37,188 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #100#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 05:49:37,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 05:49:37,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 05:49:37,188 INFO L272 TraceCheckUtils]: 30: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 05:49:37,188 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #98#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 05:49:37,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 05:49:37,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 05:49:37,189 INFO L272 TraceCheckUtils]: 25: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 05:49:37,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {16292#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {16365#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16292#(< ~counter~0 9)} is VALID [2022-04-28 05:49:37,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {16365#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16365#(< ~counter~0 8)} is VALID [2022-04-28 05:49:37,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {16365#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {16365#(< ~counter~0 8)} is VALID [2022-04-28 05:49:37,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {16375#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16365#(< ~counter~0 8)} is VALID [2022-04-28 05:49:37,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {16375#(< ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16375#(< ~counter~0 7)} is VALID [2022-04-28 05:49:37,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {16375#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {16375#(< ~counter~0 7)} is VALID [2022-04-28 05:49:37,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {16385#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16375#(< ~counter~0 7)} is VALID [2022-04-28 05:49:37,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {16385#(< ~counter~0 6)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16084#true} {16385#(< ~counter~0 6)} #96#return; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 05:49:37,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 05:49:37,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 05:49:37,193 INFO L272 TraceCheckUtils]: 11: Hoare triple {16385#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16084#true} is VALID [2022-04-28 05:49:37,193 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16084#true} {16385#(< ~counter~0 6)} #94#return; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 05:49:37,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 05:49:37,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 05:49:37,194 INFO L272 TraceCheckUtils]: 6: Hoare triple {16385#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16084#true} is VALID [2022-04-28 05:49:37,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {16385#(< ~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;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; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {16385#(< ~counter~0 6)} call #t~ret9 := main(); {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16385#(< ~counter~0 6)} {16084#true} #108#return; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {16385#(< ~counter~0 6)} assume true; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {16084#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {16385#(< ~counter~0 6)} is VALID [2022-04-28 05:49:37,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {16084#true} call ULTIMATE.init(); {16084#true} is VALID [2022-04-28 05:49:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:49:37,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:37,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400966966] [2022-04-28 05:49:37,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:37,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976604897] [2022-04-28 05:49:37,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976604897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:37,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:37,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:49:37,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:37,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676268880] [2022-04-28 05:49:37,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676268880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:37,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:37,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:49:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393615885] [2022-04-28 05:49:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:37,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2022-04-28 05:49:37,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:37,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:37,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:37,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:49:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:49:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:49:37,232 INFO L87 Difference]: Start difference. First operand 321 states and 462 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:37,897 INFO L93 Difference]: Finished difference Result 335 states and 475 transitions. [2022-04-28 05:49:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:49:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2022-04-28 05:49:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 05:49:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 05:49:37,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-28 05:49:37,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:37,957 INFO L225 Difference]: With dead ends: 335 [2022-04-28 05:49:37,957 INFO L226 Difference]: Without dead ends: 328 [2022-04-28 05:49:37,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:49:37,958 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:49:37,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 177 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:49:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-28 05:49:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-04-28 05:49:38,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:49:38,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:38,568 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:38,568 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:38,575 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 05:49:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 05:49:38,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:38,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:38,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 328 states. [2022-04-28 05:49:38,577 INFO L87 Difference]: Start difference. First operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 328 states. [2022-04-28 05:49:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:38,583 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 05:49:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 05:49:38,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:49:38,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:49:38,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:49:38,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:49:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:49:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 465 transitions. [2022-04-28 05:49:38,609 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 465 transitions. Word has length 57 [2022-04-28 05:49:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:49:38,609 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 465 transitions. [2022-04-28 05:49:38,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:38,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 465 transitions. [2022-04-28 05:49:39,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 465 transitions. [2022-04-28 05:49:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 05:49:39,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:49:39,251 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:49:39,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 05:49:39,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 05:49:39,452 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:49:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:49:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-28 05:49:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320667642] [2022-04-28 05:49:39,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:49:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 2 times [2022-04-28 05:49:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:49:39,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079582890] [2022-04-28 05:49:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:49:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:49:39,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:49:39,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112292337] [2022-04-28 05:49:39,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:49:39,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:49:39,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:49:39,483 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:49:39,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 05:49:39,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:49:39,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:49:39,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 05:49:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:49:39,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:49:40,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {18417#true} call ULTIMATE.init(); {18417#true} is VALID [2022-04-28 05:49:40,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {18417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {18417#true} is VALID [2022-04-28 05:49:40,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18417#true} {18417#true} #108#return; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {18417#true} call #t~ret9 := main(); {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {18417#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;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; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {18417#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18417#true} {18417#true} #94#return; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {18417#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:40,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18417#true} {18417#true} #96#return; {18417#true} is VALID [2022-04-28 05:49:40,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {18417#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18470#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {18470#(and (= main_~r~0 0) (= 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; {18470#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {18470#(and (= main_~r~0 0) (= 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; {18470#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {18470#(and (= main_~r~0 0) (= 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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,236 INFO L272 TraceCheckUtils]: 25: Hoare triple {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= 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)); {18417#true} is VALID [2022-04-28 05:49:40,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {18417#true} ~cond := #in~cond; {18503#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:40,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {18503#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:49:40,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:49:40,238 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} {18490#(and (= main_~b~0 main_~v~0) (= 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_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,238 INFO L272 TraceCheckUtils]: 30: Hoare triple {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {18417#true} is VALID [2022-04-28 05:49:40,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:40,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:40,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:40,239 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18417#true} {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,239 INFO L272 TraceCheckUtils]: 35: Hoare triple {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {18417#true} is VALID [2022-04-28 05:49:40,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:40,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:40,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:40,240 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18417#true} {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,240 INFO L272 TraceCheckUtils]: 40: Hoare triple {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18417#true} is VALID [2022-04-28 05:49:40,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:40,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:40,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:40,241 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18417#true} {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:49:40,244 INFO L290 TraceCheckUtils]: 50: Hoare triple {18566#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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; {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:49:40,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:49:40,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:49:40,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18589#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:49:40,246 INFO L272 TraceCheckUtils]: 54: Hoare triple {18589#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:40,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:40,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {18597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18418#false} is VALID [2022-04-28 05:49:40,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {18418#false} assume !false; {18418#false} is VALID [2022-04-28 05:49:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 05:49:40,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:56,755 INFO L290 TraceCheckUtils]: 57: Hoare triple {18418#false} assume !false; {18418#false} is VALID [2022-04-28 05:49:56,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {18597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18418#false} is VALID [2022-04-28 05:49:56,755 INFO L290 TraceCheckUtils]: 55: Hoare triple {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:49:56,756 INFO L272 TraceCheckUtils]: 54: Hoare triple {18613#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:49:56,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18613#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:49:56,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:49:56,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:49:57,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:49:57,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,618 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18417#true} {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:57,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:57,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:57,619 INFO L272 TraceCheckUtils]: 40: Hoare triple {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18417#true} is VALID [2022-04-28 05:49:57,619 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18417#true} {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:57,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:57,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:57,620 INFO L272 TraceCheckUtils]: 35: Hoare triple {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {18417#true} is VALID [2022-04-28 05:49:57,622 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18417#true} {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:57,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:57,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:57,622 INFO L272 TraceCheckUtils]: 30: Hoare triple {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {18417#true} is VALID [2022-04-28 05:49:57,623 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:49:57,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {18702#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:49:57,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {18417#true} ~cond := #in~cond; {18702#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:49:57,624 INFO L272 TraceCheckUtils]: 25: Hoare triple {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {18417#true} is VALID [2022-04-28 05:49:57,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 10);havoc #t~post8; {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {18715#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18692#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:49:57,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {18715#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 10);havoc #t~post7; {18715#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:49:57,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {18715#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18715#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:49:57,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18715#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:49:57,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:49:57,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:49:57,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {18417#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:49:57,628 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18417#true} {18417#true} #96#return; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L272 TraceCheckUtils]: 11: Hoare triple {18417#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18417#true} {18417#true} #94#return; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L272 TraceCheckUtils]: 6: Hoare triple {18417#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {18417#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;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; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {18417#true} call #t~ret9 := main(); {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18417#true} {18417#true} #108#return; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 05:49:57,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {18417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {18417#true} is VALID [2022-04-28 05:49:57,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {18417#true} call ULTIMATE.init(); {18417#true} is VALID [2022-04-28 05:49:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 05:49:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:49:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079582890] [2022-04-28 05:49:57,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:49:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112292337] [2022-04-28 05:49:57,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112292337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:49:57,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:49:57,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 05:49:57,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:49:57,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320667642] [2022-04-28 05:49:57,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320667642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:49:57,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:49:57,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:49:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315169195] [2022-04-28 05:49:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:49:57,631 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-04-28 05:49:57,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:49:57,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:57,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:49:57,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:49:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:49:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:49:57,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:49:57,675 INFO L87 Difference]: Start difference. First operand 324 states and 465 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:49:59,953 INFO L93 Difference]: Finished difference Result 384 states and 559 transitions. [2022-04-28 05:49:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:49:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-04-28 05:49:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:49:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 05:49:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:49:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 05:49:59,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 149 transitions. [2022-04-28 05:50:00,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:00,101 INFO L225 Difference]: With dead ends: 384 [2022-04-28 05:50:00,101 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 05:50:00,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-04-28 05:50:00,102 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 66 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:00,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 399 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 05:50:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 05:50:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2022-04-28 05:50:00,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:00,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 05:50:00,967 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 05:50:00,968 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 05:50:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:00,979 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 05:50:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 05:50:00,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:00,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:00,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) Second operand 381 states. [2022-04-28 05:50:00,981 INFO L87 Difference]: Start difference. First operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) Second operand 381 states. [2022-04-28 05:50:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:00,990 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 05:50:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 05:50:00,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:00,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:00,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:00,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 05:50:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 551 transitions. [2022-04-28 05:50:01,002 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 551 transitions. Word has length 58 [2022-04-28 05:50:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:01,002 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 551 transitions. [2022-04-28 05:50:01,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:01,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 551 transitions. [2022-04-28 05:50:01,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 551 transitions. [2022-04-28 05:50:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 05:50:01,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:01,630 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:01,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:01,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 05:50:01,830 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 1 times [2022-04-28 05:50:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:01,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936690715] [2022-04-28 05:50:01,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 2 times [2022-04-28 05:50:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:01,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684629511] [2022-04-28 05:50:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:01,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:01,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672150435] [2022-04-28 05:50:01,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:01,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:01,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:01,846 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:01,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 05:50:01,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:01,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:01,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:50:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:01,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:02,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {21077#true} call ULTIMATE.init(); {21077#true} is VALID [2022-04-28 05:50:02,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {21077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {21085#(<= ~counter~0 0)} assume true; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21085#(<= ~counter~0 0)} {21077#true} #108#return; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {21085#(<= ~counter~0 0)} call #t~ret9 := main(); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {21085#(<= ~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;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; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {21085#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {21085#(<= ~counter~0 0)} ~cond := #in~cond; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {21085#(<= ~counter~0 0)} assume !(0 == ~cond); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {21085#(<= ~counter~0 0)} assume true; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21085#(<= ~counter~0 0)} {21085#(<= ~counter~0 0)} #94#return; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {21085#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {21085#(<= ~counter~0 0)} ~cond := #in~cond; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {21085#(<= ~counter~0 0)} assume !(0 == ~cond); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {21085#(<= ~counter~0 0)} assume true; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21085#(<= ~counter~0 0)} {21085#(<= ~counter~0 0)} #96#return; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {21085#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:02,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {21085#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21134#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:02,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {21134#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {21134#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:02,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {21134#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21134#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:02,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {21134#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21144#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:02,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {21144#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {21144#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:02,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {21144#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {21144#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:02,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {21144#(<= ~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; {21144#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:02,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {21144#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21157#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:02,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {21157#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {21157#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:02,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {21157#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21157#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:02,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {21157#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {21167#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {21167#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {21167#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {21177#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,160 INFO L272 TraceCheckUtils]: 32: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,161 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #98#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,161 INFO L272 TraceCheckUtils]: 37: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,163 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #100#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,164 INFO L272 TraceCheckUtils]: 42: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,165 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #102#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,166 INFO L272 TraceCheckUtils]: 47: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,167 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #104#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {21177#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {21177#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {21177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21250#(<= |main_#t~post7| 5)} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 55: Hoare triple {21250#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {21078#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; {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {21078#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {21078#false} assume !(#t~post6 < 10);havoc #t~post6; {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L272 TraceCheckUtils]: 59: Hoare triple {21078#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {21078#false} ~cond := #in~cond; {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {21078#false} assume 0 == ~cond; {21078#false} is VALID [2022-04-28 05:50:02,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {21078#false} assume !false; {21078#false} is VALID [2022-04-28 05:50:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:02,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:02,469 INFO L290 TraceCheckUtils]: 62: Hoare triple {21078#false} assume !false; {21078#false} is VALID [2022-04-28 05:50:02,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {21078#false} assume 0 == ~cond; {21078#false} is VALID [2022-04-28 05:50:02,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {21078#false} ~cond := #in~cond; {21078#false} is VALID [2022-04-28 05:50:02,470 INFO L272 TraceCheckUtils]: 59: Hoare triple {21078#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {21078#false} is VALID [2022-04-28 05:50:02,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {21078#false} assume !(#t~post6 < 10);havoc #t~post6; {21078#false} is VALID [2022-04-28 05:50:02,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {21078#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21078#false} is VALID [2022-04-28 05:50:02,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {21078#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; {21078#false} is VALID [2022-04-28 05:50:02,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {21296#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {21078#false} is VALID [2022-04-28 05:50:02,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {21300#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21296#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:50:02,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {21300#(< ~counter~0 10)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {21300#(< ~counter~0 10)} assume !(~c~0 >= 2 * ~v~0); {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,471 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #104#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 05:50:02,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 05:50:02,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 05:50:02,472 INFO L272 TraceCheckUtils]: 47: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 05:50:02,472 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #102#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 05:50:02,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 05:50:02,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 05:50:02,472 INFO L272 TraceCheckUtils]: 42: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 05:50:02,473 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #100#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 05:50:02,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 05:50:02,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 05:50:02,473 INFO L272 TraceCheckUtils]: 37: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 05:50:02,473 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #98#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 05:50:02,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 05:50:02,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 05:50:02,474 INFO L272 TraceCheckUtils]: 32: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 05:50:02,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {21300#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {21373#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21300#(< ~counter~0 10)} is VALID [2022-04-28 05:50:02,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {21373#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21373#(< ~counter~0 9)} is VALID [2022-04-28 05:50:02,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {21373#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {21373#(< ~counter~0 9)} is VALID [2022-04-28 05:50:02,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {21383#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21373#(< ~counter~0 9)} is VALID [2022-04-28 05:50:02,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {21383#(< ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21383#(< ~counter~0 8)} is VALID [2022-04-28 05:50:02,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {21383#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {21383#(< ~counter~0 8)} is VALID [2022-04-28 05:50:02,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {21393#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21383#(< ~counter~0 8)} is VALID [2022-04-28 05:50:02,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {21393#(< ~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; {21393#(< ~counter~0 7)} is VALID [2022-04-28 05:50:02,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {21393#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {21393#(< ~counter~0 7)} is VALID [2022-04-28 05:50:02,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {21393#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {21393#(< ~counter~0 7)} is VALID [2022-04-28 05:50:02,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {21177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21393#(< ~counter~0 7)} is VALID [2022-04-28 05:50:02,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {21177#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {21177#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {21167#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:02,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {21167#(<= ~counter~0 4)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,479 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21077#true} {21167#(<= ~counter~0 4)} #96#return; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L272 TraceCheckUtils]: 11: Hoare triple {21167#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21077#true} {21167#(<= ~counter~0 4)} #94#return; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {21167#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21077#true} is VALID [2022-04-28 05:50:02,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {21167#(<= ~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;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; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {21167#(<= ~counter~0 4)} call #t~ret9 := main(); {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21167#(<= ~counter~0 4)} {21077#true} #108#return; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {21167#(<= ~counter~0 4)} assume true; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {21077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:02,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {21077#true} call ULTIMATE.init(); {21077#true} is VALID [2022-04-28 05:50:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:02,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:02,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684629511] [2022-04-28 05:50:02,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:02,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672150435] [2022-04-28 05:50:02,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672150435] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:02,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:02,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:50:02,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:02,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936690715] [2022-04-28 05:50:02,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936690715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:02,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:02,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:50:02,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241896694] [2022-04-28 05:50:02,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2022-04-28 05:50:02,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:02,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:02,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:02,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:50:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:02,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:50:02,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:50:02,515 INFO L87 Difference]: Start difference. First operand 377 states and 551 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:03,724 INFO L93 Difference]: Finished difference Result 604 states and 873 transitions. [2022-04-28 05:50:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:50:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2022-04-28 05:50:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-04-28 05:50:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-04-28 05:50:03,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 158 transitions. [2022-04-28 05:50:03,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:03,851 INFO L225 Difference]: With dead ends: 604 [2022-04-28 05:50:03,851 INFO L226 Difference]: Without dead ends: 440 [2022-04-28 05:50:03,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:50:03,852 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:03,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 236 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-28 05:50:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 426. [2022-04-28 05:50:04,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:04,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 05:50:04,844 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 05:50:04,845 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 05:50:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:04,858 INFO L93 Difference]: Finished difference Result 440 states and 611 transitions. [2022-04-28 05:50:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2022-04-28 05:50:04,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:04,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:04,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) Second operand 440 states. [2022-04-28 05:50:04,860 INFO L87 Difference]: Start difference. First operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) Second operand 440 states. [2022-04-28 05:50:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:04,871 INFO L93 Difference]: Finished difference Result 440 states and 611 transitions. [2022-04-28 05:50:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2022-04-28 05:50:04,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:04,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:04,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:04,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 05:50:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 598 transitions. [2022-04-28 05:50:04,887 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 598 transitions. Word has length 63 [2022-04-28 05:50:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:04,887 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 598 transitions. [2022-04-28 05:50:04,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:04,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 598 transitions. [2022-04-28 05:50:05,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 598 edges. 598 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 598 transitions. [2022-04-28 05:50:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 05:50:05,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:05,557 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:05,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 05:50:05,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1288112160, now seen corresponding path program 3 times [2022-04-28 05:50:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837428688] [2022-04-28 05:50:05,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1288112160, now seen corresponding path program 4 times [2022-04-28 05:50:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135100667] [2022-04-28 05:50:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:05,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:05,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909335117] [2022-04-28 05:50:05,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:05,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:05,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:05,784 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:05,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 05:50:05,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:05,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:05,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:50:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:05,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:06,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {24414#true} call ULTIMATE.init(); {24414#true} is VALID [2022-04-28 05:50:06,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {24414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {24422#(<= ~counter~0 0)} assume true; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24422#(<= ~counter~0 0)} {24414#true} #108#return; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {24422#(<= ~counter~0 0)} call #t~ret9 := main(); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {24422#(<= ~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;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; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {24422#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {24422#(<= ~counter~0 0)} ~cond := #in~cond; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {24422#(<= ~counter~0 0)} assume !(0 == ~cond); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {24422#(<= ~counter~0 0)} assume true; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24422#(<= ~counter~0 0)} {24422#(<= ~counter~0 0)} #94#return; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,187 INFO L272 TraceCheckUtils]: 11: Hoare triple {24422#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {24422#(<= ~counter~0 0)} ~cond := #in~cond; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {24422#(<= ~counter~0 0)} assume !(0 == ~cond); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {24422#(<= ~counter~0 0)} assume true; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,188 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24422#(<= ~counter~0 0)} {24422#(<= ~counter~0 0)} #96#return; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {24422#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:06,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {24422#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24471#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:06,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {24471#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {24471#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:06,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {24471#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24471#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:06,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {24471#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24481#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:06,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {24481#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {24481#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:06,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {24481#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {24481#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:06,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {24481#(<= ~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; {24481#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:06,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {24481#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {24494#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {24494#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {24494#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:06,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {24504#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:06,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {24504#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:06,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {24504#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {24514#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,194 INFO L272 TraceCheckUtils]: 32: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,196 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #98#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,196 INFO L272 TraceCheckUtils]: 37: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,198 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #100#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,198 INFO L272 TraceCheckUtils]: 42: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,200 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #102#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,200 INFO L272 TraceCheckUtils]: 47: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,201 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #104#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {24514#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,202 INFO L290 TraceCheckUtils]: 53: Hoare triple {24514#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {24514#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,203 INFO L290 TraceCheckUtils]: 55: Hoare triple {24587#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {24587#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {24587#(<= ~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; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {24587#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24600#(<= |main_#t~post6| 6)} is VALID [2022-04-28 05:50:06,204 INFO L290 TraceCheckUtils]: 59: Hoare triple {24600#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {24415#false} is VALID [2022-04-28 05:50:06,204 INFO L272 TraceCheckUtils]: 60: Hoare triple {24415#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {24415#false} is VALID [2022-04-28 05:50:06,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {24415#false} ~cond := #in~cond; {24415#false} is VALID [2022-04-28 05:50:06,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {24415#false} assume 0 == ~cond; {24415#false} is VALID [2022-04-28 05:50:06,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {24415#false} assume !false; {24415#false} is VALID [2022-04-28 05:50:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:06,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:06,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {24415#false} assume !false; {24415#false} is VALID [2022-04-28 05:50:06,510 INFO L290 TraceCheckUtils]: 62: Hoare triple {24415#false} assume 0 == ~cond; {24415#false} is VALID [2022-04-28 05:50:06,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {24415#false} ~cond := #in~cond; {24415#false} is VALID [2022-04-28 05:50:06,510 INFO L272 TraceCheckUtils]: 60: Hoare triple {24415#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {24415#false} is VALID [2022-04-28 05:50:06,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {24628#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {24415#false} is VALID [2022-04-28 05:50:06,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {24632#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24628#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:50:06,511 INFO L290 TraceCheckUtils]: 57: Hoare triple {24632#(< ~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; {24632#(< ~counter~0 10)} is VALID [2022-04-28 05:50:06,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {24632#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {24632#(< ~counter~0 10)} is VALID [2022-04-28 05:50:06,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {24632#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {24632#(< ~counter~0 10)} is VALID [2022-04-28 05:50:06,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {24645#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24632#(< ~counter~0 10)} is VALID [2022-04-28 05:50:06,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {24645#(< ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {24645#(< ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,514 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #104#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 05:50:06,514 INFO L290 TraceCheckUtils]: 49: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 05:50:06,514 INFO L290 TraceCheckUtils]: 48: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 05:50:06,514 INFO L272 TraceCheckUtils]: 47: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 05:50:06,514 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #102#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 05:50:06,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 05:50:06,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 05:50:06,515 INFO L272 TraceCheckUtils]: 42: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 05:50:06,515 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #100#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 05:50:06,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 05:50:06,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 05:50:06,515 INFO L272 TraceCheckUtils]: 37: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 05:50:06,516 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #98#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 05:50:06,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 05:50:06,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 05:50:06,516 INFO L272 TraceCheckUtils]: 32: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 05:50:06,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {24645#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {24718#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24645#(< ~counter~0 9)} is VALID [2022-04-28 05:50:06,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {24718#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {24718#(< ~counter~0 8)} is VALID [2022-04-28 05:50:06,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {24718#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {24718#(< ~counter~0 8)} is VALID [2022-04-28 05:50:06,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {24587#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24718#(< ~counter~0 8)} is VALID [2022-04-28 05:50:06,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {24587#(<= ~counter~0 6)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {24587#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {24514#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:06,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {24514#(<= ~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; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {24514#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {24514#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {24504#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:06,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {24504#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:06,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {24504#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:06,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {24494#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:06,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {24494#(<= ~counter~0 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,522 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24414#true} {24494#(<= ~counter~0 3)} #96#return; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 05:50:06,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 05:50:06,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 05:50:06,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {24494#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24414#true} is VALID [2022-04-28 05:50:06,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24414#true} {24494#(<= ~counter~0 3)} #94#return; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 05:50:06,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 05:50:06,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 05:50:06,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {24494#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24414#true} is VALID [2022-04-28 05:50:06,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {24494#(<= ~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;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {24494#(<= ~counter~0 3)} call #t~ret9 := main(); {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24494#(<= ~counter~0 3)} {24414#true} #108#return; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {24494#(<= ~counter~0 3)} assume true; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {24414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:06,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {24414#true} call ULTIMATE.init(); {24414#true} is VALID [2022-04-28 05:50:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:06,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:06,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135100667] [2022-04-28 05:50:06,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:06,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909335117] [2022-04-28 05:50:06,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909335117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:06,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:06,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:50:06,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:06,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837428688] [2022-04-28 05:50:06,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837428688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:06,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:06,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:50:06,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749468457] [2022-04-28 05:50:06,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-04-28 05:50:06,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:06,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:06,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:06,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:50:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:50:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:50:06,563 INFO L87 Difference]: Start difference. First operand 426 states and 598 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:07,962 INFO L93 Difference]: Finished difference Result 531 states and 722 transitions. [2022-04-28 05:50:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:50:07,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-04-28 05:50:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2022-04-28 05:50:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2022-04-28 05:50:07,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 162 transitions. [2022-04-28 05:50:08,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:08,101 INFO L225 Difference]: With dead ends: 531 [2022-04-28 05:50:08,101 INFO L226 Difference]: Without dead ends: 524 [2022-04-28 05:50:08,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:50:08,102 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 104 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:08,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 245 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-04-28 05:50:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 503. [2022-04-28 05:50:09,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:09,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:09,299 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:09,299 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:09,313 INFO L93 Difference]: Finished difference Result 524 states and 713 transitions. [2022-04-28 05:50:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 713 transitions. [2022-04-28 05:50:09,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:09,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:09,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 524 states. [2022-04-28 05:50:09,315 INFO L87 Difference]: Start difference. First operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 524 states. [2022-04-28 05:50:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:09,327 INFO L93 Difference]: Finished difference Result 524 states and 713 transitions. [2022-04-28 05:50:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 713 transitions. [2022-04-28 05:50:09,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:09,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:09,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:09,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 691 transitions. [2022-04-28 05:50:09,343 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 691 transitions. Word has length 64 [2022-04-28 05:50:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:09,344 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 691 transitions. [2022-04-28 05:50:09,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:09,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 503 states and 691 transitions. [2022-04-28 05:50:10,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 691 edges. 691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 691 transitions. [2022-04-28 05:50:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 05:50:10,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:10,140 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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] [2022-04-28 05:50:10,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:10,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:10,340 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1156119236, now seen corresponding path program 1 times [2022-04-28 05:50:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1364034758] [2022-04-28 05:50:10,341 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1156119236, now seen corresponding path program 2 times [2022-04-28 05:50:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304997354] [2022-04-28 05:50:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:10,354 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:10,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362560309] [2022-04-28 05:50:10,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:10,364 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:10,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 05:50:10,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:10,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:10,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 05:50:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:10,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:10,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {27935#true} call ULTIMATE.init(); {27935#true} is VALID [2022-04-28 05:50:10,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {27935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {27935#true} is VALID [2022-04-28 05:50:10,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27935#true} {27935#true} #108#return; {27935#true} is VALID [2022-04-28 05:50:10,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {27935#true} call #t~ret9 := main(); {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {27935#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;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; {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {27935#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27935#true} {27935#true} #94#return; {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {27935#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {27935#true} ~cond := #in~cond; {27976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:50:10,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {27976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:50:10,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {27980#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:50:10,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27980#(not (= |assume_abort_if_not_#in~cond| 0))} {27935#true} #96#return; {27987#(<= 1 main_~y~0)} is VALID [2022-04-28 05:50:10,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {27987#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 05:50:10,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {27991#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 05:50:10,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 05:50:10,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 05:50:10,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {27991#(<= 1 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 05:50:10,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(#t~post7 < 10);havoc #t~post7; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 05:50:10,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,678 INFO L272 TraceCheckUtils]: 25: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,679 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #98#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,679 INFO L272 TraceCheckUtils]: 30: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,680 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #100#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,680 INFO L272 TraceCheckUtils]: 35: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,680 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #102#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,680 INFO L272 TraceCheckUtils]: 40: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,681 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #104#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,682 INFO L272 TraceCheckUtils]: 48: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,683 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27935#true} {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #98#return; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,683 INFO L272 TraceCheckUtils]: 53: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,683 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27935#true} {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #100#return; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,684 INFO L272 TraceCheckUtils]: 58: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,684 INFO L290 TraceCheckUtils]: 59: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,684 INFO L290 TraceCheckUtils]: 61: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,684 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {27935#true} {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #102#return; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 05:50:10,685 INFO L272 TraceCheckUtils]: 63: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:10,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:10,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {28139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27936#false} is VALID [2022-04-28 05:50:10,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {27936#false} assume !false; {27936#false} is VALID [2022-04-28 05:50:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-28 05:50:10,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:10,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {27936#false} assume !false; {27936#false} is VALID [2022-04-28 05:50:10,886 INFO L290 TraceCheckUtils]: 65: Hoare triple {28139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27936#false} is VALID [2022-04-28 05:50:10,886 INFO L290 TraceCheckUtils]: 64: Hoare triple {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:10,886 INFO L272 TraceCheckUtils]: 63: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:10,887 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,887 INFO L272 TraceCheckUtils]: 58: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,887 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,888 INFO L290 TraceCheckUtils]: 56: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L272 TraceCheckUtils]: 53: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,888 INFO L272 TraceCheckUtils]: 48: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,891 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,891 INFO L272 TraceCheckUtils]: 40: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,892 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,892 INFO L272 TraceCheckUtils]: 35: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L272 TraceCheckUtils]: 30: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,894 INFO L272 TraceCheckUtils]: 25: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {27935#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:50:10,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {27935#true} assume !!(#t~post7 < 10);havoc #t~post7; {27935#true} is VALID [2022-04-28 05:50:10,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {27935#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {27935#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {27935#true} assume !!(#t~post6 < 10);havoc #t~post6; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {27935#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {27935#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27935#true} {27935#true} #96#return; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L272 TraceCheckUtils]: 11: Hoare triple {27935#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27935#true} {27935#true} #94#return; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 05:50:10,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {27935#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {27935#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;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; {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {27935#true} call #t~ret9 := main(); {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27935#true} {27935#true} #108#return; {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {27935#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {27935#true} call ULTIMATE.init(); {27935#true} is VALID [2022-04-28 05:50:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-28 05:50:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:10,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304997354] [2022-04-28 05:50:10,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:10,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362560309] [2022-04-28 05:50:10,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362560309] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:50:10,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:50:10,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 05:50:10,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:10,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1364034758] [2022-04-28 05:50:10,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1364034758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:10,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:10,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101540539] [2022-04-28 05:50:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-04-28 05:50:10,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:10,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:10,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:10,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:50:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:50:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:50:10,934 INFO L87 Difference]: Start difference. First operand 503 states and 691 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:11,764 INFO L93 Difference]: Finished difference Result 517 states and 704 transitions. [2022-04-28 05:50:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:50:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-04-28 05:50:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 05:50:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 05:50:11,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 05:50:11,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:11,827 INFO L225 Difference]: With dead ends: 517 [2022-04-28 05:50:11,827 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 05:50:11,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:50:11,828 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:11,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:50:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 05:50:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2022-04-28 05:50:12,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:12,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:12,997 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:12,997 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:13,009 INFO L93 Difference]: Finished difference Result 515 states and 699 transitions. [2022-04-28 05:50:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-28 05:50:13,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:13,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:13,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 515 states. [2022-04-28 05:50:13,011 INFO L87 Difference]: Start difference. First operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 515 states. [2022-04-28 05:50:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:13,022 INFO L93 Difference]: Finished difference Result 515 states and 699 transitions. [2022-04-28 05:50:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-28 05:50:13,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:13,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:13,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:13,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 695 transitions. [2022-04-28 05:50:13,038 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 695 transitions. Word has length 67 [2022-04-28 05:50:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:13,038 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 695 transitions. [2022-04-28 05:50:13,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:13,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 695 transitions. [2022-04-28 05:50:13,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 695 transitions. [2022-04-28 05:50:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 05:50:13,910 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:13,910 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:13,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:14,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:14,126 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1261753774, now seen corresponding path program 3 times [2022-04-28 05:50:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:14,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777275261] [2022-04-28 05:50:14,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1261753774, now seen corresponding path program 4 times [2022-04-28 05:50:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:14,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471433134] [2022-04-28 05:50:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:14,149 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:14,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1640901065] [2022-04-28 05:50:14,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:14,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:14,154 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:14,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 05:50:14,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:14,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:14,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 05:50:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:14,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:14,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {31435#true} call ULTIMATE.init(); {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {31435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31435#true} {31435#true} #108#return; {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {31435#true} call #t~ret9 := main(); {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {31435#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;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; {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {31435#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31435#true} {31435#true} #94#return; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L272 TraceCheckUtils]: 11: Hoare triple {31435#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31435#true} {31435#true} #96#return; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {31435#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {31435#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {31435#true} assume !!(#t~post6 < 10);havoc #t~post6; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {31435#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {31435#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31435#true} is VALID [2022-04-28 05:50:14,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {31435#true} assume !!(#t~post7 < 10);havoc #t~post7; {31435#true} is VALID [2022-04-28 05:50:14,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {31435#true} assume !(~c~0 >= ~b~0); {31506#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:50:14,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {31506#(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; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:50:14,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {31510#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:50:14,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:50:14,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:50:14,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {31520#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:50:14,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:50:14,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {31530#(< main_~v~0 main_~c~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !!(#t~post8 < 10);havoc #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,361 INFO L272 TraceCheckUtils]: 32: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,361 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #98#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,361 INFO L272 TraceCheckUtils]: 37: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,362 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #100#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,362 INFO L272 TraceCheckUtils]: 42: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,362 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #102#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,363 INFO L272 TraceCheckUtils]: 47: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,363 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #104#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {31530#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {31603#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,364 INFO L290 TraceCheckUtils]: 55: Hoare triple {31603#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,364 INFO L290 TraceCheckUtils]: 56: Hoare triple {31603#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,383 INFO L290 TraceCheckUtils]: 57: Hoare triple {31603#(< 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; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 05:50:14,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {31616#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 05:50:14,384 INFO L290 TraceCheckUtils]: 59: Hoare triple {31616#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 05:50:14,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {31616#(< 0 main_~b~0)} assume !(0 != ~b~0); {31436#false} is VALID [2022-04-28 05:50:14,384 INFO L272 TraceCheckUtils]: 61: Hoare triple {31436#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {31436#false} is VALID [2022-04-28 05:50:14,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {31436#false} ~cond := #in~cond; {31436#false} is VALID [2022-04-28 05:50:14,384 INFO L290 TraceCheckUtils]: 63: Hoare triple {31436#false} assume 0 == ~cond; {31436#false} is VALID [2022-04-28 05:50:14,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {31436#false} assume !false; {31436#false} is VALID [2022-04-28 05:50:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:14,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:14,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {31436#false} assume !false; {31436#false} is VALID [2022-04-28 05:50:14,565 INFO L290 TraceCheckUtils]: 63: Hoare triple {31436#false} assume 0 == ~cond; {31436#false} is VALID [2022-04-28 05:50:14,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {31436#false} ~cond := #in~cond; {31436#false} is VALID [2022-04-28 05:50:14,565 INFO L272 TraceCheckUtils]: 61: Hoare triple {31436#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {31436#false} is VALID [2022-04-28 05:50:14,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {31616#(< 0 main_~b~0)} assume !(0 != ~b~0); {31436#false} is VALID [2022-04-28 05:50:14,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {31616#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 05:50:14,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {31616#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 05:50:14,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {31603#(< 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; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 05:50:14,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {31603#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {31603#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {31603#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {31530#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 05:50:14,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,568 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #104#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,568 INFO L272 TraceCheckUtils]: 47: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,568 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #102#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,569 INFO L272 TraceCheckUtils]: 42: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,569 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #100#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,569 INFO L272 TraceCheckUtils]: 37: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,570 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #98#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,570 INFO L272 TraceCheckUtils]: 32: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !!(#t~post8 < 10);havoc #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {31530#(< main_~v~0 main_~c~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:50:14,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:50:14,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {31520#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:50:14,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:50:14,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:50:14,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {31510#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:50:14,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {31506#(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; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:50:14,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {31435#true} assume !(~c~0 >= ~b~0); {31506#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:50:14,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {31435#true} assume !!(#t~post7 < 10);havoc #t~post7; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {31435#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {31435#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {31435#true} assume !!(#t~post6 < 10);havoc #t~post6; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {31435#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {31435#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31435#true} {31435#true} #96#return; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {31435#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31435#true} {31435#true} #94#return; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 05:50:14,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {31435#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {31435#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;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; {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {31435#true} call #t~ret9 := main(); {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31435#true} {31435#true} #108#return; {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {31435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {31435#true} call ULTIMATE.init(); {31435#true} is VALID [2022-04-28 05:50:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471433134] [2022-04-28 05:50:14,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640901065] [2022-04-28 05:50:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640901065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:14,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:14,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:50:14,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:14,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777275261] [2022-04-28 05:50:14,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777275261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:14,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:14,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:50:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295337221] [2022-04-28 05:50:14,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:14,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 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 65 [2022-04-28 05:50:14,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:14,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:14,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:14,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:50:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:50:14,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:50:14,617 INFO L87 Difference]: Start difference. First operand 511 states and 695 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:17,245 INFO L93 Difference]: Finished difference Result 857 states and 1271 transitions. [2022-04-28 05:50:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 05:50:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 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 65 [2022-04-28 05:50:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 227 transitions. [2022-04-28 05:50:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 227 transitions. [2022-04-28 05:50:17,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 227 transitions. [2022-04-28 05:50:17,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:17,434 INFO L225 Difference]: With dead ends: 857 [2022-04-28 05:50:17,434 INFO L226 Difference]: Without dead ends: 850 [2022-04-28 05:50:17,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:50:17,435 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 81 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:17,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 452 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:50:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-04-28 05:50:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 567. [2022-04-28 05:50:18,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:18,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 850 states. Second operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:18,588 INFO L74 IsIncluded]: Start isIncluded. First operand 850 states. Second operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:18,588 INFO L87 Difference]: Start difference. First operand 850 states. Second operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:18,620 INFO L93 Difference]: Finished difference Result 850 states and 1261 transitions. [2022-04-28 05:50:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1261 transitions. [2022-04-28 05:50:18,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:18,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:18,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 850 states. [2022-04-28 05:50:18,624 INFO L87 Difference]: Start difference. First operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 850 states. [2022-04-28 05:50:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:18,655 INFO L93 Difference]: Finished difference Result 850 states and 1261 transitions. [2022-04-28 05:50:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1261 transitions. [2022-04-28 05:50:18,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:18,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:18,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:18,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 783 transitions. [2022-04-28 05:50:18,693 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 783 transitions. Word has length 65 [2022-04-28 05:50:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:18,693 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 783 transitions. [2022-04-28 05:50:18,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:18,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 567 states and 783 transitions. [2022-04-28 05:50:19,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 783 edges. 783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 783 transitions. [2022-04-28 05:50:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 05:50:19,575 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:19,575 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:19,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 05:50:19,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 05:50:19,796 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 365174246, now seen corresponding path program 1 times [2022-04-28 05:50:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476719890] [2022-04-28 05:50:19,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash 365174246, now seen corresponding path program 2 times [2022-04-28 05:50:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502802820] [2022-04-28 05:50:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:19,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:19,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269957874] [2022-04-28 05:50:19,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:19,822 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:19,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 05:50:19,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:19,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:19,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:50:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:19,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:20,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {36412#true} call ULTIMATE.init(); {36412#true} is VALID [2022-04-28 05:50:20,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {36412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {36420#(<= ~counter~0 0)} assume true; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36420#(<= ~counter~0 0)} {36412#true} #108#return; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {36420#(<= ~counter~0 0)} call #t~ret9 := main(); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {36420#(<= ~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;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; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {36420#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {36420#(<= ~counter~0 0)} ~cond := #in~cond; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {36420#(<= ~counter~0 0)} assume !(0 == ~cond); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {36420#(<= ~counter~0 0)} assume true; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36420#(<= ~counter~0 0)} {36420#(<= ~counter~0 0)} #94#return; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {36420#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {36420#(<= ~counter~0 0)} ~cond := #in~cond; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {36420#(<= ~counter~0 0)} assume !(0 == ~cond); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {36420#(<= ~counter~0 0)} assume true; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36420#(<= ~counter~0 0)} {36420#(<= ~counter~0 0)} #96#return; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {36420#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:20,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {36420#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36469#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:20,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {36469#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {36469#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:20,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {36469#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36469#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:20,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {36469#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36479#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:20,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {36479#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {36479#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:20,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {36479#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {36479#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:20,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {36479#(<= ~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; {36479#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:20,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {36479#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36492#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:20,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {36492#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {36492#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:20,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {36492#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36492#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:20,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {36492#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {36502#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {36502#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {36502#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {36512#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,060 INFO L272 TraceCheckUtils]: 32: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,061 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #98#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,062 INFO L272 TraceCheckUtils]: 37: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,063 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #100#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,063 INFO L272 TraceCheckUtils]: 42: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,064 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #102#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,064 INFO L272 TraceCheckUtils]: 47: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,065 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #104#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {36512#(<= ~counter~0 5)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {36512#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36582#(<= |main_#t~post8| 5)} is VALID [2022-04-28 05:50:20,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {36582#(<= |main_#t~post8| 5)} assume !(#t~post8 < 10);havoc #t~post8; {36413#false} is VALID [2022-04-28 05:50:20,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {36413#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {36413#false} is VALID [2022-04-28 05:50:20,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {36413#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36413#false} is VALID [2022-04-28 05:50:20,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {36413#false} assume !(#t~post7 < 10);havoc #t~post7; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {36413#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; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {36413#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {36413#false} assume !(#t~post6 < 10);havoc #t~post6; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L272 TraceCheckUtils]: 61: Hoare triple {36413#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {36413#false} ~cond := #in~cond; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {36413#false} assume 0 == ~cond; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {36413#false} assume !false; {36413#false} is VALID [2022-04-28 05:50:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:20,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:20,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {36413#false} assume !false; {36413#false} is VALID [2022-04-28 05:50:20,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {36413#false} assume 0 == ~cond; {36413#false} is VALID [2022-04-28 05:50:20,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {36413#false} ~cond := #in~cond; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L272 TraceCheckUtils]: 61: Hoare triple {36413#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {36413#false} assume !(#t~post6 < 10);havoc #t~post6; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {36413#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {36413#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; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {36413#false} assume !(#t~post7 < 10);havoc #t~post7; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {36413#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {36413#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {36646#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {36413#false} is VALID [2022-04-28 05:50:20,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {36650#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36646#(< |main_#t~post8| 10)} is VALID [2022-04-28 05:50:20,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {36650#(< ~counter~0 10)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,298 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #104#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,298 INFO L290 TraceCheckUtils]: 50: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 05:50:20,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 05:50:20,298 INFO L290 TraceCheckUtils]: 48: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 05:50:20,298 INFO L272 TraceCheckUtils]: 47: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 05:50:20,299 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #102#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 05:50:20,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 05:50:20,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 05:50:20,299 INFO L272 TraceCheckUtils]: 42: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 05:50:20,299 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #100#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L272 TraceCheckUtils]: 37: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #98#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 05:50:20,300 INFO L272 TraceCheckUtils]: 32: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 05:50:20,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {36650#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {36720#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36650#(< ~counter~0 10)} is VALID [2022-04-28 05:50:20,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {36720#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {36720#(< ~counter~0 9)} is VALID [2022-04-28 05:50:20,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {36720#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {36720#(< ~counter~0 9)} is VALID [2022-04-28 05:50:20,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {36730#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36720#(< ~counter~0 9)} is VALID [2022-04-28 05:50:20,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {36730#(< ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36730#(< ~counter~0 8)} is VALID [2022-04-28 05:50:20,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {36730#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {36730#(< ~counter~0 8)} is VALID [2022-04-28 05:50:20,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {36740#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36730#(< ~counter~0 8)} is VALID [2022-04-28 05:50:20,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {36740#(< ~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; {36740#(< ~counter~0 7)} is VALID [2022-04-28 05:50:20,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {36740#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {36740#(< ~counter~0 7)} is VALID [2022-04-28 05:50:20,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {36740#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {36740#(< ~counter~0 7)} is VALID [2022-04-28 05:50:20,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {36512#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36740#(< ~counter~0 7)} is VALID [2022-04-28 05:50:20,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {36512#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {36512#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {36502#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:20,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {36502#(<= ~counter~0 4)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36412#true} {36502#(<= ~counter~0 4)} #96#return; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 05:50:20,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 05:50:20,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 05:50:20,307 INFO L272 TraceCheckUtils]: 11: Hoare triple {36502#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36412#true} is VALID [2022-04-28 05:50:20,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36412#true} {36502#(<= ~counter~0 4)} #94#return; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 05:50:20,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 05:50:20,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 05:50:20,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {36502#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {36412#true} is VALID [2022-04-28 05:50:20,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {36502#(<= ~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;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; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {36502#(<= ~counter~0 4)} call #t~ret9 := main(); {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36502#(<= ~counter~0 4)} {36412#true} #108#return; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {36502#(<= ~counter~0 4)} assume true; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {36412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:20,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {36412#true} call ULTIMATE.init(); {36412#true} is VALID [2022-04-28 05:50:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502802820] [2022-04-28 05:50:20,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269957874] [2022-04-28 05:50:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269957874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:20,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:20,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:50:20,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476719890] [2022-04-28 05:50:20,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476719890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:20,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:20,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:50:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571942346] [2022-04-28 05:50:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-04-28 05:50:20,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:20,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:20,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:20,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:50:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:50:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:50:20,383 INFO L87 Difference]: Start difference. First operand 567 states and 783 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:21,367 INFO L93 Difference]: Finished difference Result 839 states and 1203 transitions. [2022-04-28 05:50:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:50:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-04-28 05:50:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2022-04-28 05:50:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2022-04-28 05:50:21,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 153 transitions. [2022-04-28 05:50:21,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:21,452 INFO L225 Difference]: With dead ends: 839 [2022-04-28 05:50:21,452 INFO L226 Difference]: Without dead ends: 567 [2022-04-28 05:50:21,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:50:21,455 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:21,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 193 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-04-28 05:50:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2022-04-28 05:50:22,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:22,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 567 states. Second operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:22,255 INFO L74 IsIncluded]: Start isIncluded. First operand 567 states. Second operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:22,255 INFO L87 Difference]: Start difference. First operand 567 states. Second operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:22,282 INFO L93 Difference]: Finished difference Result 567 states and 779 transitions. [2022-04-28 05:50:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2022-04-28 05:50:22,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:22,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:22,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 567 states. [2022-04-28 05:50:22,292 INFO L87 Difference]: Start difference. First operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 567 states. [2022-04-28 05:50:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:22,304 INFO L93 Difference]: Finished difference Result 567 states and 779 transitions. [2022-04-28 05:50:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2022-04-28 05:50:22,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:22,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:22,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:22,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 05:50:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 779 transitions. [2022-04-28 05:50:22,351 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 779 transitions. Word has length 65 [2022-04-28 05:50:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:22,351 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 779 transitions. [2022-04-28 05:50:22,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:22,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 567 states and 779 transitions. [2022-04-28 05:50:23,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2022-04-28 05:50:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 05:50:23,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:23,200 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:23,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:23,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 05:50:23,416 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash -544828664, now seen corresponding path program 1 times [2022-04-28 05:50:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:23,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054997318] [2022-04-28 05:50:23,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash -544828664, now seen corresponding path program 2 times [2022-04-28 05:50:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:23,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726599602] [2022-04-28 05:50:23,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:23,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:23,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975531554] [2022-04-28 05:50:23,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:23,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:23,454 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:23,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 05:50:23,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:23,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:23,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 05:50:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:23,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:23,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {40767#true} call ULTIMATE.init(); {40767#true} is VALID [2022-04-28 05:50:23,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {40767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {40767#true} is VALID [2022-04-28 05:50:23,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40767#true} {40767#true} #108#return; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {40767#true} call #t~ret9 := main(); {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {40767#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;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; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {40767#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40767#true} {40767#true} #94#return; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {40767#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40767#true} {40767#true} #96#return; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {40767#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {40767#true} is VALID [2022-04-28 05:50:23,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {40767#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {40767#true} assume !!(#t~post6 < 10);havoc #t~post6; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {40767#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {40767#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {40767#true} assume !!(#t~post7 < 10);havoc #t~post7; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {40767#true} assume !(~c~0 >= ~b~0); {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {40767#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; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {40767#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {40767#true} assume !!(#t~post6 < 10);havoc #t~post6; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {40767#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {40767#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40767#true} is VALID [2022-04-28 05:50:23,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {40767#true} assume !!(#t~post7 < 10);havoc #t~post7; {40767#true} is VALID [2022-04-28 05:50:23,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {40767#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {40859#(<= main_~v~0 main_~b~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {40859#(<= main_~v~0 main_~b~0)} assume !!(#t~post8 < 10);havoc #t~post8; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,663 INFO L272 TraceCheckUtils]: 32: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 05:50:23,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 05:50:23,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 05:50:23,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,664 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #98#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,664 INFO L272 TraceCheckUtils]: 37: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 05:50:23,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 05:50:23,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 05:50:23,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,665 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #100#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,665 INFO L272 TraceCheckUtils]: 42: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 05:50:23,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 05:50:23,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 05:50:23,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,666 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #102#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,666 INFO L272 TraceCheckUtils]: 47: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 05:50:23,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 05:50:23,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 05:50:23,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 05:50:23,667 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #104#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:50:23,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {40859#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {40929#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 05:50:23,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {40929#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {40933#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 05:50:23,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {40933#(< main_~c~0 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40933#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 05:50:23,668 INFO L290 TraceCheckUtils]: 55: Hoare triple {40933#(< main_~c~0 main_~b~0)} assume !!(#t~post7 < 10);havoc #t~post7; {40933#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 56: Hoare triple {40933#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {40768#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {40768#false} assume !(#t~post8 < 10);havoc #t~post8; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {40768#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {40768#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {40768#false} assume !(#t~post7 < 10);havoc #t~post7; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {40768#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; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {40768#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 64: Hoare triple {40768#false} assume !(#t~post6 < 10);havoc #t~post6; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L272 TraceCheckUtils]: 65: Hoare triple {40768#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 66: Hoare triple {40768#false} ~cond := #in~cond; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 67: Hoare triple {40768#false} assume 0 == ~cond; {40768#false} is VALID [2022-04-28 05:50:23,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {40768#false} assume !false; {40768#false} is VALID [2022-04-28 05:50:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 05:50:23,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726599602] [2022-04-28 05:50:23,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975531554] [2022-04-28 05:50:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975531554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:23,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:23,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:23,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054997318] [2022-04-28 05:50:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054997318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:23,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:23,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149662266] [2022-04-28 05:50:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:23,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 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 69 [2022-04-28 05:50:23,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:23,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:23,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:23,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:50:23,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:23,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:50:23,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:50:23,710 INFO L87 Difference]: Start difference. First operand 567 states and 779 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:25,365 INFO L93 Difference]: Finished difference Result 980 states and 1387 transitions. [2022-04-28 05:50:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:50:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 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 69 [2022-04-28 05:50:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-28 05:50:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-28 05:50:25,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-28 05:50:25,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:25,461 INFO L225 Difference]: With dead ends: 980 [2022-04-28 05:50:25,461 INFO L226 Difference]: Without dead ends: 624 [2022-04-28 05:50:25,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:50:25,463 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:25,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:50:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-04-28 05:50:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 568. [2022-04-28 05:50:26,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:26,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:26,623 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:26,623 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:26,637 INFO L93 Difference]: Finished difference Result 624 states and 852 transitions. [2022-04-28 05:50:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 852 transitions. [2022-04-28 05:50:26,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:26,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:26,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) Second operand 624 states. [2022-04-28 05:50:26,639 INFO L87 Difference]: Start difference. First operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) Second operand 624 states. [2022-04-28 05:50:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:26,662 INFO L93 Difference]: Finished difference Result 624 states and 852 transitions. [2022-04-28 05:50:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 852 transitions. [2022-04-28 05:50:26,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:26,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:26,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:26,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 779 transitions. [2022-04-28 05:50:26,678 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 779 transitions. Word has length 69 [2022-04-28 05:50:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:26,679 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 779 transitions. [2022-04-28 05:50:26,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:26,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 568 states and 779 transitions. [2022-04-28 05:50:27,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 779 transitions. [2022-04-28 05:50:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 05:50:27,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:27,638 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:27,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:27,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:27,852 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:27,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash -996119216, now seen corresponding path program 3 times [2022-04-28 05:50:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:27,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037862410] [2022-04-28 05:50:27,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -996119216, now seen corresponding path program 4 times [2022-04-28 05:50:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:27,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274425375] [2022-04-28 05:50:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:27,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:27,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:27,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352846825] [2022-04-28 05:50:27,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:27,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:27,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:27,866 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:27,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 05:50:27,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:27,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:27,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:50:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:27,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:28,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {45325#true} call ULTIMATE.init(); {45325#true} is VALID [2022-04-28 05:50:28,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {45325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {45333#(<= ~counter~0 0)} assume true; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45333#(<= ~counter~0 0)} {45325#true} #108#return; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {45333#(<= ~counter~0 0)} call #t~ret9 := main(); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {45333#(<= ~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;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; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {45333#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {45333#(<= ~counter~0 0)} ~cond := #in~cond; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {45333#(<= ~counter~0 0)} assume !(0 == ~cond); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {45333#(<= ~counter~0 0)} assume true; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45333#(<= ~counter~0 0)} {45333#(<= ~counter~0 0)} #94#return; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,143 INFO L272 TraceCheckUtils]: 11: Hoare triple {45333#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {45333#(<= ~counter~0 0)} ~cond := #in~cond; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {45333#(<= ~counter~0 0)} assume !(0 == ~cond); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {45333#(<= ~counter~0 0)} assume true; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45333#(<= ~counter~0 0)} {45333#(<= ~counter~0 0)} #96#return; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {45333#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:28,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {45333#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45382#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:28,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {45382#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {45382#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:28,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {45382#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45382#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:28,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {45382#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45392#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:28,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {45392#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {45392#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:28,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {45392#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45392#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:28,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {45392#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {45402#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,147 INFO L272 TraceCheckUtils]: 25: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,149 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #98#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,149 INFO L272 TraceCheckUtils]: 30: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,150 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #100#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,150 INFO L272 TraceCheckUtils]: 35: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,151 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #102#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,152 INFO L272 TraceCheckUtils]: 40: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,153 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #104#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {45402#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {45402#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {45402#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {45475#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {45475#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {45475#(<= ~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; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {45475#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:28,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {45488#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:28,155 INFO L290 TraceCheckUtils]: 53: Hoare triple {45488#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:28,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {45488#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {45498#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {45498#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {45498#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45508#(<= |main_#t~post8| 6)} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {45508#(<= |main_#t~post8| 6)} assume !(#t~post8 < 10);havoc #t~post8; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {45326#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {45326#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 61: Hoare triple {45326#false} assume !(#t~post7 < 10);havoc #t~post7; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#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; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 63: Hoare triple {45326#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 64: Hoare triple {45326#false} assume !(#t~post6 < 10);havoc #t~post6; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L272 TraceCheckUtils]: 65: Hoare triple {45326#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {45326#false} ~cond := #in~cond; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {45326#false} assume 0 == ~cond; {45326#false} is VALID [2022-04-28 05:50:28,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {45326#false} assume !false; {45326#false} is VALID [2022-04-28 05:50:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:28,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:28,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {45326#false} assume !false; {45326#false} is VALID [2022-04-28 05:50:28,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {45326#false} assume 0 == ~cond; {45326#false} is VALID [2022-04-28 05:50:28,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {45326#false} ~cond := #in~cond; {45326#false} is VALID [2022-04-28 05:50:28,447 INFO L272 TraceCheckUtils]: 65: Hoare triple {45326#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {45326#false} is VALID [2022-04-28 05:50:28,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {45326#false} assume !(#t~post6 < 10);havoc #t~post6; {45326#false} is VALID [2022-04-28 05:50:28,447 INFO L290 TraceCheckUtils]: 63: Hoare triple {45326#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45326#false} is VALID [2022-04-28 05:50:28,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#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; {45326#false} is VALID [2022-04-28 05:50:28,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {45326#false} assume !(#t~post7 < 10);havoc #t~post7; {45326#false} is VALID [2022-04-28 05:50:28,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {45326#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45326#false} is VALID [2022-04-28 05:50:28,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {45326#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45326#false} is VALID [2022-04-28 05:50:28,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {45572#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {45326#false} is VALID [2022-04-28 05:50:28,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {45576#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45572#(< |main_#t~post8| 10)} is VALID [2022-04-28 05:50:28,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {45576#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45576#(< ~counter~0 10)} is VALID [2022-04-28 05:50:28,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {45576#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {45576#(< ~counter~0 10)} is VALID [2022-04-28 05:50:28,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {45586#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45576#(< ~counter~0 10)} is VALID [2022-04-28 05:50:28,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {45586#(< ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45586#(< ~counter~0 9)} is VALID [2022-04-28 05:50:28,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {45586#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {45586#(< ~counter~0 9)} is VALID [2022-04-28 05:50:28,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {45596#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45586#(< ~counter~0 9)} is VALID [2022-04-28 05:50:28,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {45596#(< ~counter~0 8)} ~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; {45596#(< ~counter~0 8)} is VALID [2022-04-28 05:50:28,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {45596#(< ~counter~0 8)} assume !(~c~0 >= ~b~0); {45596#(< ~counter~0 8)} is VALID [2022-04-28 05:50:28,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {45596#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {45596#(< ~counter~0 8)} is VALID [2022-04-28 05:50:28,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {45498#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45596#(< ~counter~0 8)} is VALID [2022-04-28 05:50:28,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {45498#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {45498#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,453 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #104#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 05:50:28,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 05:50:28,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 05:50:28,453 INFO L272 TraceCheckUtils]: 40: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #102#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L272 TraceCheckUtils]: 35: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #100#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 05:50:28,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 05:50:28,455 INFO L272 TraceCheckUtils]: 30: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 05:50:28,455 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #98#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 05:50:28,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 05:50:28,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 05:50:28,455 INFO L272 TraceCheckUtils]: 25: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 05:50:28,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {45498#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {45488#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:28,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {45488#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:28,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {45488#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:28,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {45475#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:28,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {45475#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {45475#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {45402#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:28,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {45402#(<= ~counter~0 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45325#true} {45402#(<= ~counter~0 3)} #96#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 05:50:28,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 05:50:28,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 05:50:28,459 INFO L272 TraceCheckUtils]: 11: Hoare triple {45402#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45325#true} is VALID [2022-04-28 05:50:28,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45325#true} {45402#(<= ~counter~0 3)} #94#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 05:50:28,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 05:50:28,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 05:50:28,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {45402#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45325#true} is VALID [2022-04-28 05:50:28,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {45402#(<= ~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;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; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {45402#(<= ~counter~0 3)} call #t~ret9 := main(); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45402#(<= ~counter~0 3)} {45325#true} #108#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {45325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:28,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {45325#true} call ULTIMATE.init(); {45325#true} is VALID [2022-04-28 05:50:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274425375] [2022-04-28 05:50:28,462 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352846825] [2022-04-28 05:50:28,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352846825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:28,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:28,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:50:28,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037862410] [2022-04-28 05:50:28,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037862410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:28,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:28,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:50:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060951907] [2022-04-28 05:50:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-04-28 05:50:28,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:28,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:28,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:28,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:50:28,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:28,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:50:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:50:28,501 INFO L87 Difference]: Start difference. First operand 568 states and 779 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:29,810 INFO L93 Difference]: Finished difference Result 914 states and 1304 transitions. [2022-04-28 05:50:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:50:29,810 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-04-28 05:50:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2022-04-28 05:50:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2022-04-28 05:50:29,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 181 transitions. [2022-04-28 05:50:29,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:29,963 INFO L225 Difference]: With dead ends: 914 [2022-04-28 05:50:29,963 INFO L226 Difference]: Without dead ends: 584 [2022-04-28 05:50:29,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:50:29,965 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 96 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:29,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 256 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-28 05:50:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 575. [2022-04-28 05:50:31,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:31,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:31,173 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:31,174 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:31,186 INFO L93 Difference]: Finished difference Result 584 states and 794 transitions. [2022-04-28 05:50:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 794 transitions. [2022-04-28 05:50:31,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:31,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:31,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand 584 states. [2022-04-28 05:50:31,188 INFO L87 Difference]: Start difference. First operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand 584 states. [2022-04-28 05:50:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:31,201 INFO L93 Difference]: Finished difference Result 584 states and 794 transitions. [2022-04-28 05:50:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 794 transitions. [2022-04-28 05:50:31,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:31,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:31,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:31,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 05:50:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 786 transitions. [2022-04-28 05:50:31,218 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 786 transitions. Word has length 69 [2022-04-28 05:50:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:31,218 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 786 transitions. [2022-04-28 05:50:31,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:31,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 575 states and 786 transitions. [2022-04-28 05:50:32,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 786 edges. 786 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 786 transitions. [2022-04-28 05:50:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 05:50:32,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:32,401 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:32,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 05:50:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:32,602 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash 862858316, now seen corresponding path program 3 times [2022-04-28 05:50:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:32,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090712226] [2022-04-28 05:50:32,603 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash 862858316, now seen corresponding path program 4 times [2022-04-28 05:50:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:32,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361271026] [2022-04-28 05:50:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:32,619 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:32,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285148808] [2022-04-28 05:50:32,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:32,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:32,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:32,622 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:32,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 05:50:32,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:32,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:32,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:50:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:32,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:33,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {49906#true} call ULTIMATE.init(); {49906#true} is VALID [2022-04-28 05:50:33,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {49906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#(<= ~counter~0 0)} assume true; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49914#(<= ~counter~0 0)} {49906#true} #108#return; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {49914#(<= ~counter~0 0)} call #t~ret9 := main(); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {49914#(<= ~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;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; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,026 INFO L272 TraceCheckUtils]: 6: Hoare triple {49914#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {49914#(<= ~counter~0 0)} ~cond := #in~cond; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {49914#(<= ~counter~0 0)} assume !(0 == ~cond); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {49914#(<= ~counter~0 0)} assume true; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49914#(<= ~counter~0 0)} {49914#(<= ~counter~0 0)} #94#return; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {49914#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {49914#(<= ~counter~0 0)} ~cond := #in~cond; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {49914#(<= ~counter~0 0)} assume !(0 == ~cond); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {49914#(<= ~counter~0 0)} assume true; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,029 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49914#(<= ~counter~0 0)} {49914#(<= ~counter~0 0)} #96#return; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {49914#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:33,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {49914#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49963#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:33,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {49963#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {49963#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:33,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {49963#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {49963#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:33,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {49963#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {49973#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {49973#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {49973#(<= ~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; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {49973#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:33,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {49986#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:33,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {49986#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:33,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {49986#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {49996#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {49996#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {49996#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {50006#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,035 INFO L272 TraceCheckUtils]: 32: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,037 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #98#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,037 INFO L272 TraceCheckUtils]: 37: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,038 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #100#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,039 INFO L272 TraceCheckUtils]: 42: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,040 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #102#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,041 INFO L272 TraceCheckUtils]: 47: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,042 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #104#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {50006#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {50006#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {50006#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {50079#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {50079#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {50079#(<= ~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; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {50079#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {50092#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {50092#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {50092#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50102#(<= |main_#t~post7| 7)} is VALID [2022-04-28 05:50:33,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {50102#(<= |main_#t~post7| 7)} assume !(#t~post7 < 10);havoc #t~post7; {49907#false} is VALID [2022-04-28 05:50:33,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {49907#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; {49907#false} is VALID [2022-04-28 05:50:33,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {49907#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49907#false} is VALID [2022-04-28 05:50:33,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {49907#false} assume !(#t~post6 < 10);havoc #t~post6; {49907#false} is VALID [2022-04-28 05:50:33,058 INFO L272 TraceCheckUtils]: 66: Hoare triple {49907#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {49907#false} is VALID [2022-04-28 05:50:33,059 INFO L290 TraceCheckUtils]: 67: Hoare triple {49907#false} ~cond := #in~cond; {49907#false} is VALID [2022-04-28 05:50:33,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {49907#false} assume 0 == ~cond; {49907#false} is VALID [2022-04-28 05:50:33,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {49907#false} assume !false; {49907#false} is VALID [2022-04-28 05:50:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:33,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:33,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {49907#false} assume !false; {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {49907#false} assume 0 == ~cond; {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {49907#false} ~cond := #in~cond; {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L272 TraceCheckUtils]: 66: Hoare triple {49907#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {49907#false} assume !(#t~post6 < 10);havoc #t~post6; {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {49907#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {49907#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; {49907#false} is VALID [2022-04-28 05:50:33,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {50148#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {49907#false} is VALID [2022-04-28 05:50:33,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {50152#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50148#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:50:33,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {50152#(< ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50152#(< ~counter~0 10)} is VALID [2022-04-28 05:50:33,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {50152#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {50152#(< ~counter~0 10)} is VALID [2022-04-28 05:50:33,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {50162#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50152#(< ~counter~0 10)} is VALID [2022-04-28 05:50:33,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {50162#(< ~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; {50162#(< ~counter~0 9)} is VALID [2022-04-28 05:50:33,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {50162#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {50162#(< ~counter~0 9)} is VALID [2022-04-28 05:50:33,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {50162#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {50162#(< ~counter~0 9)} is VALID [2022-04-28 05:50:33,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {50092#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50162#(< ~counter~0 9)} is VALID [2022-04-28 05:50:33,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {50092#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {50092#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,359 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #104#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 05:50:33,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 05:50:33,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 05:50:33,360 INFO L272 TraceCheckUtils]: 47: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 05:50:33,360 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #102#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 05:50:33,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 05:50:33,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 05:50:33,361 INFO L272 TraceCheckUtils]: 42: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 05:50:33,361 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #100#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 05:50:33,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 05:50:33,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 05:50:33,361 INFO L272 TraceCheckUtils]: 37: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 05:50:33,362 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #98#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 05:50:33,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 05:50:33,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 05:50:33,362 INFO L272 TraceCheckUtils]: 32: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 05:50:33,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {50092#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {50079#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 05:50:33,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {50079#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {50079#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {50006#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 05:50:33,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {50006#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {50006#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {49996#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 05:50:33,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {49996#(<= ~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; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {49996#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {49996#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {49986#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 05:50:33,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {49986#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:33,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {49986#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:33,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {49973#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:33,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {49973#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,368 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49906#true} {49973#(<= ~counter~0 2)} #96#return; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 05:50:33,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 05:50:33,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 05:50:33,368 INFO L272 TraceCheckUtils]: 11: Hoare triple {49973#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49906#true} is VALID [2022-04-28 05:50:33,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49906#true} {49973#(<= ~counter~0 2)} #94#return; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 05:50:33,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 05:50:33,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 05:50:33,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {49973#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49906#true} is VALID [2022-04-28 05:50:33,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {49973#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {49973#(<= ~counter~0 2)} call #t~ret9 := main(); {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49973#(<= ~counter~0 2)} {49906#true} #108#return; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {49973#(<= ~counter~0 2)} assume true; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {49906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:33,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {49906#true} call ULTIMATE.init(); {49906#true} is VALID [2022-04-28 05:50:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:50:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361271026] [2022-04-28 05:50:33,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285148808] [2022-04-28 05:50:33,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285148808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:33,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:33,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 05:50:33,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:33,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090712226] [2022-04-28 05:50:33,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090712226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:33,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:33,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:50:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269030418] [2022-04-28 05:50:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-04-28 05:50:33,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:33,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:33,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:33,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:50:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:50:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:50:33,413 INFO L87 Difference]: Start difference. First operand 575 states and 786 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:35,121 INFO L93 Difference]: Finished difference Result 918 states and 1274 transitions. [2022-04-28 05:50:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:50:35,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-04-28 05:50:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-04-28 05:50:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-04-28 05:50:35,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 210 transitions. [2022-04-28 05:50:35,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:35,247 INFO L225 Difference]: With dead ends: 918 [2022-04-28 05:50:35,247 INFO L226 Difference]: Without dead ends: 688 [2022-04-28 05:50:35,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:50:35,248 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 139 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:35,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 261 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-04-28 05:50:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 658. [2022-04-28 05:50:36,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:36,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 688 states. Second operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 05:50:36,988 INFO L74 IsIncluded]: Start isIncluded. First operand 688 states. Second operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 05:50:36,989 INFO L87 Difference]: Start difference. First operand 688 states. Second operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 05:50:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:37,004 INFO L93 Difference]: Finished difference Result 688 states and 910 transitions. [2022-04-28 05:50:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 910 transitions. [2022-04-28 05:50:37,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:37,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:37,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) Second operand 688 states. [2022-04-28 05:50:37,006 INFO L87 Difference]: Start difference. First operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) Second operand 688 states. [2022-04-28 05:50:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:37,022 INFO L93 Difference]: Finished difference Result 688 states and 910 transitions. [2022-04-28 05:50:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 910 transitions. [2022-04-28 05:50:37,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:37,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:37,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:37,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 05:50:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 880 transitions. [2022-04-28 05:50:37,043 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 880 transitions. Word has length 70 [2022-04-28 05:50:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:37,044 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 880 transitions. [2022-04-28 05:50:37,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:50:37,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 658 states and 880 transitions. [2022-04-28 05:50:38,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 880 transitions. [2022-04-28 05:50:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 05:50:38,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:38,281 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:38,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 05:50:38,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 05:50:38,496 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1546062343, now seen corresponding path program 1 times [2022-04-28 05:50:38,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:38,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157632944] [2022-04-28 05:50:38,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1546062343, now seen corresponding path program 2 times [2022-04-28 05:50:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:38,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552889142] [2022-04-28 05:50:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:38,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:38,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958466557] [2022-04-28 05:50:38,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:38,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:38,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:38,508 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:38,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 05:50:38,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:38,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:38,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:50:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:38,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:38,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {54877#true} call ULTIMATE.init(); {54877#true} is VALID [2022-04-28 05:50:38,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {54877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {54877#true} is VALID [2022-04-28 05:50:38,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:38,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54877#true} {54877#true} #108#return; {54877#true} is VALID [2022-04-28 05:50:38,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {54877#true} call #t~ret9 := main(); {54877#true} is VALID [2022-04-28 05:50:38,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {54877#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;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; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {54877#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {54877#true} {54877#true} #94#return; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L272 TraceCheckUtils]: 11: Hoare triple {54877#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {54877#true} {54877#true} #96#return; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {54877#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 05:50:38,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {54877#true} assume !(~c~0 >= ~b~0); {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {54877#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; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {54877#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {54877#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {54877#true} assume !!(#t~post8 < 10);havoc #t~post8; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L272 TraceCheckUtils]: 32: Hoare triple {54877#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:38,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:38,798 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {54877#true} {54877#true} #98#return; {54877#true} is VALID [2022-04-28 05:50:38,798 INFO L272 TraceCheckUtils]: 37: Hoare triple {54877#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:38,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {54877#true} ~cond := #in~cond; {54996#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:38,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {54996#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:38,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:38,799 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} {54877#true} #100#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,799 INFO L272 TraceCheckUtils]: 42: Hoare triple {55007#(= 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)); {54877#true} is VALID [2022-04-28 05:50:38,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:38,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:38,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:38,799 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,799 INFO L272 TraceCheckUtils]: 47: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:38,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:38,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:38,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:38,800 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #104#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:38,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {55007#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:38,804 INFO L272 TraceCheckUtils]: 66: Hoare triple {55056#(= 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)); {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:38,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:38,804 INFO L290 TraceCheckUtils]: 68: Hoare triple {55088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54878#false} is VALID [2022-04-28 05:50:38,804 INFO L290 TraceCheckUtils]: 69: Hoare triple {54878#false} assume !false; {54878#false} is VALID [2022-04-28 05:50:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 05:50:38,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:50,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {54878#false} assume !false; {54878#false} is VALID [2022-04-28 05:50:50,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {55088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54878#false} is VALID [2022-04-28 05:50:50,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:50,977 INFO L272 TraceCheckUtils]: 66: Hoare triple {55056#(= 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)); {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:50,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {55007#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:50:50,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,982 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #104#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:50,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:50,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:50,982 INFO L272 TraceCheckUtils]: 47: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:50,983 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:50,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:50,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:50,983 INFO L272 TraceCheckUtils]: 42: Hoare triple {55007#(= 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)); {54877#true} is VALID [2022-04-28 05:50:50,984 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} {54877#true} #100#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:50:50,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:50,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {55188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {54877#true} ~cond := #in~cond; {55188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:50,985 INFO L272 TraceCheckUtils]: 37: Hoare triple {54877#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {54877#true} {54877#true} #98#return; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L272 TraceCheckUtils]: 32: Hoare triple {54877#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {54877#true} assume !!(#t~post8 < 10);havoc #t~post8; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {54877#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {54877#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 05:50:50,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {54877#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; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {54877#true} assume !(~c~0 >= ~b~0); {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {54877#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {54877#true} {54877#true} #96#return; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:50,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {54877#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {54877#true} {54877#true} #94#return; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {54877#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {54877#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;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; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {54877#true} call #t~ret9 := main(); {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54877#true} {54877#true} #108#return; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {54877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {54877#true} call ULTIMATE.init(); {54877#true} is VALID [2022-04-28 05:50:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 05:50:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552889142] [2022-04-28 05:50:50,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958466557] [2022-04-28 05:50:50,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958466557] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:50,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:50,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:50:50,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157632944] [2022-04-28 05:50:50,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157632944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:50,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:50,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:50:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929419433] [2022-04-28 05:50:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-04-28 05:50:50,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:50,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:51,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:51,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:50:51,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:50:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:50:51,044 INFO L87 Difference]: Start difference. First operand 658 states and 880 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:53,345 INFO L93 Difference]: Finished difference Result 757 states and 1022 transitions. [2022-04-28 05:50:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:50:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-04-28 05:50:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-04-28 05:50:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-04-28 05:50:53,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 85 transitions. [2022-04-28 05:50:53,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:53,418 INFO L225 Difference]: With dead ends: 757 [2022-04-28 05:50:53,418 INFO L226 Difference]: Without dead ends: 755 [2022-04-28 05:50:53,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:50:53,419 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:53,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 212 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:50:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-04-28 05:50:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 748. [2022-04-28 05:50:54,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:54,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 755 states. Second operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 05:50:54,648 INFO L74 IsIncluded]: Start isIncluded. First operand 755 states. Second operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 05:50:54,648 INFO L87 Difference]: Start difference. First operand 755 states. Second operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 05:50:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:54,666 INFO L93 Difference]: Finished difference Result 755 states and 1020 transitions. [2022-04-28 05:50:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1020 transitions. [2022-04-28 05:50:54,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:54,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:54,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) Second operand 755 states. [2022-04-28 05:50:54,668 INFO L87 Difference]: Start difference. First operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) Second operand 755 states. [2022-04-28 05:50:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:54,686 INFO L93 Difference]: Finished difference Result 755 states and 1020 transitions. [2022-04-28 05:50:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1020 transitions. [2022-04-28 05:50:54,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:54,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:54,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:54,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 05:50:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1013 transitions. [2022-04-28 05:50:54,711 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1013 transitions. Word has length 70 [2022-04-28 05:50:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:54,711 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1013 transitions. [2022-04-28 05:50:54,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:50:54,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 748 states and 1013 transitions. [2022-04-28 05:50:56,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1013 edges. 1013 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:50:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1013 transitions. [2022-04-28 05:50:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 05:50:56,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:56,046 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:50:56,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 05:50:56,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 05:50:56,250 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash -705069158, now seen corresponding path program 3 times [2022-04-28 05:50:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:56,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042175975] [2022-04-28 05:50:56,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash -705069158, now seen corresponding path program 4 times [2022-04-28 05:50:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:56,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838716936] [2022-04-28 05:50:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:56,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:56,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396859163] [2022-04-28 05:50:56,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:56,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:56,267 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:50:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 05:50:56,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:56,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:56,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 05:50:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:56,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:57,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {59832#true} call ULTIMATE.init(); {59832#true} is VALID [2022-04-28 05:50:57,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {59832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {59832#true} is VALID [2022-04-28 05:50:57,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:50:57,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59832#true} {59832#true} #108#return; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {59832#true} call #t~ret9 := main(); {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {59832#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;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; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {59832#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59832#true} {59832#true} #94#return; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {59832#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:50:57,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59832#true} {59832#true} #96#return; {59832#true} is VALID [2022-04-28 05:50:57,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {59832#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {59885#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {59885#(and (= main_~r~0 0) (= 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; {59885#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {59885#(and (= main_~r~0 0) (= 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; {59885#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {59885#(and (= main_~r~0 0) (= 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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {59895#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {59895#(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; {59895#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {59895#(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; {59895#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {59895#(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); {59895#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:50:57,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {59895#(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; {59908#(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_~q~0 1))} is VALID [2022-04-28 05:50:57,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {59908#(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_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59908#(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_~q~0 1))} is VALID [2022-04-28 05:50:57,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {59908#(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_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {59908#(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_~q~0 1))} is VALID [2022-04-28 05:50:57,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {59908#(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_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {59918#(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) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {59918#(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) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {59918#(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) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {59918#(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) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {59918#(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) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {59918#(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) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,260 INFO L272 TraceCheckUtils]: 32: Hoare triple {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:50:57,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {59832#true} ~cond := #in~cond; {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:57,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,262 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {59928#(and (= main_~b~0 main_~v~0) (= 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) (= main_~d~0 1) (= main_~q~0 1))} #98#return; {59952#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:50:57,262 INFO L272 TraceCheckUtils]: 37: Hoare triple {59952#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:50:57,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {59832#true} ~cond := #in~cond; {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:57,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,264 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {59952#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:50:57,264 INFO L272 TraceCheckUtils]: 42: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~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)); {59832#true} is VALID [2022-04-28 05:50:57,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:50:57,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:50:57,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:50:57,265 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {59832#true} {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:50:57,265 INFO L272 TraceCheckUtils]: 47: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:50:57,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:50:57,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:50:57,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:50:57,266 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {59832#true} {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:50:57,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:50:57,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,268 INFO L290 TraceCheckUtils]: 55: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,268 INFO L290 TraceCheckUtils]: 56: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 05:50:57,269 INFO L290 TraceCheckUtils]: 57: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(#t~post6 < 10);havoc #t~post6; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(#t~post7 < 10);havoc #t~post7; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,271 INFO L290 TraceCheckUtils]: 64: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(#t~post8 < 10);havoc #t~post8; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,272 INFO L272 TraceCheckUtils]: 66: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:50:57,272 INFO L290 TraceCheckUtils]: 67: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:50:57,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:50:57,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:50:57,273 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {59832#true} {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #98#return; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 05:50:57,273 INFO L272 TraceCheckUtils]: 71: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:57,274 INFO L290 TraceCheckUtils]: 72: Hoare triple {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:57,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {60065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {59833#false} is VALID [2022-04-28 05:50:57,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {59833#false} assume !false; {59833#false} is VALID [2022-04-28 05:50:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 05:50:57,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:20,910 INFO L290 TraceCheckUtils]: 74: Hoare triple {59833#false} assume !false; {59833#false} is VALID [2022-04-28 05:51:20,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {60065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {59833#false} is VALID [2022-04-28 05:51:20,911 INFO L290 TraceCheckUtils]: 72: Hoare triple {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:20,912 INFO L272 TraceCheckUtils]: 71: Hoare triple {60081#(= 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)); {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:20,912 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {59832#true} {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:51:20,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:51:20,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:51:20,913 INFO L272 TraceCheckUtils]: 66: Hoare triple {60081#(= 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)); {59832#true} is VALID [2022-04-28 05:51:20,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,914 INFO L290 TraceCheckUtils]: 63: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,914 INFO L290 TraceCheckUtils]: 62: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,915 INFO L290 TraceCheckUtils]: 60: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,915 INFO L290 TraceCheckUtils]: 59: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:20,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:22,917 WARN L290 TraceCheckUtils]: 57: Hoare triple {60124#(= (+ (* 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; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:51:22,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {60124#(= (+ (* 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); {60124#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:51:22,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {60124#(= (+ (* 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; {60124#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:51:22,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {60124#(= (+ (* 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; {60124#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:51:23,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {60124#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:51:23,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~c~0 >= 2 * ~v~0); {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:23,434 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {59832#true} {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #104#return; {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:23,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:51:23,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:51:23,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:51:23,435 INFO L272 TraceCheckUtils]: 47: Hoare triple {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:51:23,435 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {59832#true} {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #102#return; {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:23,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:51:23,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:51:23,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:51:23,436 INFO L272 TraceCheckUtils]: 42: Hoare triple {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)); {59832#true} is VALID [2022-04-28 05:51:23,437 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {60174#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} #100#return; {60137#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:23,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:23,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:23,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {59832#true} ~cond := #in~cond; {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:51:23,437 INFO L272 TraceCheckUtils]: 37: Hoare triple {60174#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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 ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:51:23,438 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} #98#return; {60174#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:51:23,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:23,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:23,439 INFO L290 TraceCheckUtils]: 33: Hoare triple {59832#true} ~cond := #in~cond; {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:51:23,439 INFO L272 TraceCheckUtils]: 32: Hoare triple {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)); {59832#true} is VALID [2022-04-28 05:51:23,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} assume !!(#t~post8 < 10);havoc #t~post8; {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:51:23,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:51:23,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {60213#(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_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:51:23,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {60213#(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_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {60213#(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_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:51:23,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {60213#(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_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60213#(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_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:51:23,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {59832#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {60213#(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_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:51:23,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {59832#true} assume !!(#t~post6 < 10);havoc #t~post6; {59832#true} is VALID [2022-04-28 05:51:23,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {59832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59832#true} is VALID [2022-04-28 05:51:23,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {59832#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; {59832#true} is VALID [2022-04-28 05:51:23,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {59832#true} assume !(~c~0 >= ~b~0); {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {59832#true} assume !!(#t~post7 < 10);havoc #t~post7; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {59832#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {59832#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {59832#true} assume !!(#t~post6 < 10);havoc #t~post6; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {59832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {59832#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59832#true} {59832#true} #96#return; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {59832#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59832#true} {59832#true} #94#return; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 05:51:23,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {59832#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {59832#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;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; {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {59832#true} call #t~ret9 := main(); {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59832#true} {59832#true} #108#return; {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {59832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {59832#true} call ULTIMATE.init(); {59832#true} is VALID [2022-04-28 05:51:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 05:51:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:23,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838716936] [2022-04-28 05:51:23,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396859163] [2022-04-28 05:51:23,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396859163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:23,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:23,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2022-04-28 05:51:23,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042175975] [2022-04-28 05:51:23,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042175975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:23,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:23,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:51:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195045177] [2022-04-28 05:51:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2022-04-28 05:51:23,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:23,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 05:51:23,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:51:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:51:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:51:23,509 INFO L87 Difference]: Start difference. First operand 748 states and 1013 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 05:51:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:26,682 INFO L93 Difference]: Finished difference Result 840 states and 1136 transitions. [2022-04-28 05:51:26,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:51:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2022-04-28 05:51:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 05:51:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-04-28 05:51:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 05:51:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-04-28 05:51:26,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 172 transitions. [2022-04-28 05:51:26,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:26,863 INFO L225 Difference]: With dead ends: 840 [2022-04-28 05:51:26,863 INFO L226 Difference]: Without dead ends: 838 [2022-04-28 05:51:26,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:51:26,864 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 83 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:26,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 446 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 05:51:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-28 05:51:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 813. [2022-04-28 05:51:28,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:28,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 838 states. Second operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 05:51:28,061 INFO L74 IsIncluded]: Start isIncluded. First operand 838 states. Second operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 05:51:28,061 INFO L87 Difference]: Start difference. First operand 838 states. Second operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 05:51:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:28,110 INFO L93 Difference]: Finished difference Result 838 states and 1134 transitions. [2022-04-28 05:51:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1134 transitions. [2022-04-28 05:51:28,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:28,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:28,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 838 states. [2022-04-28 05:51:28,129 INFO L87 Difference]: Start difference. First operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 838 states. [2022-04-28 05:51:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:28,178 INFO L93 Difference]: Finished difference Result 838 states and 1134 transitions. [2022-04-28 05:51:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1134 transitions. [2022-04-28 05:51:28,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:28,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:28,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:28,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 05:51:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1106 transitions. [2022-04-28 05:51:28,221 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1106 transitions. Word has length 75 [2022-04-28 05:51:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:28,222 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1106 transitions. [2022-04-28 05:51:28,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 05:51:28,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 813 states and 1106 transitions. [2022-04-28 05:51:29,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1106 edges. 1106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1106 transitions. [2022-04-28 05:51:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 05:51:29,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:29,804 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:51:29,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 05:51:30,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 05:51:30,018 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -949871629, now seen corresponding path program 5 times [2022-04-28 05:51:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487848003] [2022-04-28 05:51:30,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash -949871629, now seen corresponding path program 6 times [2022-04-28 05:51:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:30,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931253000] [2022-04-28 05:51:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:30,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:30,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:30,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33599721] [2022-04-28 05:51:30,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:51:30,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:30,050 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:51:30,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 05:51:30,109 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:51:30,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:30,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:51:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:30,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:30,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {65293#true} call ULTIMATE.init(); {65293#true} is VALID [2022-04-28 05:51:30,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {65293#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {65301#(<= ~counter~0 0)} assume true; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65301#(<= ~counter~0 0)} {65293#true} #108#return; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {65301#(<= ~counter~0 0)} call #t~ret9 := main(); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {65301#(<= ~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;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; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {65301#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {65301#(<= ~counter~0 0)} ~cond := #in~cond; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {65301#(<= ~counter~0 0)} assume !(0 == ~cond); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {65301#(<= ~counter~0 0)} assume true; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65301#(<= ~counter~0 0)} {65301#(<= ~counter~0 0)} #94#return; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,450 INFO L272 TraceCheckUtils]: 11: Hoare triple {65301#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {65301#(<= ~counter~0 0)} ~cond := #in~cond; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {65301#(<= ~counter~0 0)} assume !(0 == ~cond); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {65301#(<= ~counter~0 0)} assume true; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,452 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65301#(<= ~counter~0 0)} {65301#(<= ~counter~0 0)} #96#return; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {65301#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:30,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {65301#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {65350#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {65350#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {65350#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {65360#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {65360#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {65360#(<= ~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; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {65360#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {65373#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {65373#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {65373#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:30,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {65383#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:30,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {65383#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:30,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {65383#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {65393#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,458 INFO L272 TraceCheckUtils]: 32: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,460 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #98#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,460 INFO L272 TraceCheckUtils]: 37: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,461 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #100#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,462 INFO L272 TraceCheckUtils]: 42: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,462 INFO L290 TraceCheckUtils]: 43: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,462 INFO L290 TraceCheckUtils]: 44: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,471 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #102#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,471 INFO L272 TraceCheckUtils]: 47: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,472 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #104#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {65393#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {65393#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {65393#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {65466#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {65466#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {65466#(<= ~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; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {65466#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {65479#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {65479#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {65479#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 05:51:30,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {65489#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 05:51:30,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {65489#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 05:51:30,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {65489#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65499#(<= |main_#t~post8| 8)} is VALID [2022-04-28 05:51:30,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {65499#(<= |main_#t~post8| 8)} assume !(#t~post8 < 10);havoc #t~post8; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {65294#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {65294#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {65294#false} assume !(#t~post7 < 10);havoc #t~post7; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {65294#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; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {65294#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {65294#false} assume !(#t~post6 < 10);havoc #t~post6; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L272 TraceCheckUtils]: 72: Hoare triple {65294#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {65294#false} ~cond := #in~cond; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 74: Hoare triple {65294#false} assume 0 == ~cond; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L290 TraceCheckUtils]: 75: Hoare triple {65294#false} assume !false; {65294#false} is VALID [2022-04-28 05:51:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:51:30,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:30,815 INFO L290 TraceCheckUtils]: 75: Hoare triple {65294#false} assume !false; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {65294#false} assume 0 == ~cond; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {65294#false} ~cond := #in~cond; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L272 TraceCheckUtils]: 72: Hoare triple {65294#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {65294#false} assume !(#t~post6 < 10);havoc #t~post6; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {65294#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 69: Hoare triple {65294#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; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 68: Hoare triple {65294#false} assume !(#t~post7 < 10);havoc #t~post7; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {65294#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {65294#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65294#false} is VALID [2022-04-28 05:51:30,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {65563#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {65294#false} is VALID [2022-04-28 05:51:30,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {65567#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65563#(< |main_#t~post8| 10)} is VALID [2022-04-28 05:51:30,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {65567#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65567#(< ~counter~0 10)} is VALID [2022-04-28 05:51:30,817 INFO L290 TraceCheckUtils]: 62: Hoare triple {65567#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {65567#(< ~counter~0 10)} is VALID [2022-04-28 05:51:30,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {65489#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65567#(< ~counter~0 10)} is VALID [2022-04-28 05:51:30,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {65489#(<= ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 05:51:30,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {65489#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 05:51:30,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {65479#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 05:51:30,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {65479#(<= ~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; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {65479#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {65479#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {65466#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:30,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {65466#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {65466#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,827 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #104#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L272 TraceCheckUtils]: 47: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #102#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 05:51:30,828 INFO L272 TraceCheckUtils]: 42: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 05:51:30,829 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #100#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 05:51:30,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 05:51:30,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 05:51:30,829 INFO L272 TraceCheckUtils]: 37: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 05:51:30,830 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #98#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 05:51:30,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 05:51:30,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 05:51:30,830 INFO L272 TraceCheckUtils]: 32: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 05:51:30,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {65466#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {65393#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:30,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {65393#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {65393#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {65383#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:30,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {65383#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:30,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {65383#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:30,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {65373#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:30,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {65373#(<= ~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; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {65373#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {65373#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {65360#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:30,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {65360#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {65360#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {65350#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:30,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {65350#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,836 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65293#true} {65350#(<= ~counter~0 1)} #96#return; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 05:51:30,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 05:51:30,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 05:51:30,836 INFO L272 TraceCheckUtils]: 11: Hoare triple {65350#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {65293#true} is VALID [2022-04-28 05:51:30,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65293#true} {65350#(<= ~counter~0 1)} #94#return; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 05:51:30,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 05:51:30,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 05:51:30,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {65350#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {65293#true} is VALID [2022-04-28 05:51:30,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {65350#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {65350#(<= ~counter~0 1)} call #t~ret9 := main(); {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65350#(<= ~counter~0 1)} {65293#true} #108#return; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {65350#(<= ~counter~0 1)} assume true; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {65293#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:30,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {65293#true} call ULTIMATE.init(); {65293#true} is VALID [2022-04-28 05:51:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:51:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:30,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931253000] [2022-04-28 05:51:30,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:30,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33599721] [2022-04-28 05:51:30,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33599721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:30,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:30,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 05:51:30,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:30,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487848003] [2022-04-28 05:51:30,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487848003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:30,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:30,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:51:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079083504] [2022-04-28 05:51:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-04-28 05:51:30,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:30,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:51:30,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:51:30,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:30,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:51:30,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:51:30,891 INFO L87 Difference]: Start difference. First operand 813 states and 1106 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:51:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:32,967 INFO L93 Difference]: Finished difference Result 1433 states and 1997 transitions. [2022-04-28 05:51:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 05:51:32,968 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-04-28 05:51:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:51:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 239 transitions. [2022-04-28 05:51:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:51:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 239 transitions. [2022-04-28 05:51:32,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 239 transitions. [2022-04-28 05:51:33,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:33,146 INFO L225 Difference]: With dead ends: 1433 [2022-04-28 05:51:33,146 INFO L226 Difference]: Without dead ends: 975 [2022-04-28 05:51:33,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:51:33,150 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 166 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:33,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 286 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:51:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-04-28 05:51:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 947. [2022-04-28 05:51:34,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:34,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 975 states. Second operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 05:51:34,600 INFO L74 IsIncluded]: Start isIncluded. First operand 975 states. Second operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 05:51:34,600 INFO L87 Difference]: Start difference. First operand 975 states. Second operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 05:51:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:34,634 INFO L93 Difference]: Finished difference Result 975 states and 1288 transitions. [2022-04-28 05:51:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1288 transitions. [2022-04-28 05:51:34,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:34,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:34,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) Second operand 975 states. [2022-04-28 05:51:34,638 INFO L87 Difference]: Start difference. First operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) Second operand 975 states. [2022-04-28 05:51:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:34,669 INFO L93 Difference]: Finished difference Result 975 states and 1288 transitions. [2022-04-28 05:51:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1288 transitions. [2022-04-28 05:51:34,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:34,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:34,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:34,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 05:51:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1263 transitions. [2022-04-28 05:51:34,724 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1263 transitions. Word has length 76 [2022-04-28 05:51:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:34,724 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1263 transitions. [2022-04-28 05:51:34,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 05:51:34,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 947 states and 1263 transitions. [2022-04-28 05:51:36,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1263 transitions. [2022-04-28 05:51:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 05:51:36,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:36,854 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 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, 1, 1, 1] [2022-04-28 05:51:36,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 05:51:37,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 05:51:37,055 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash -362795852, now seen corresponding path program 1 times [2022-04-28 05:51:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:37,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377522727] [2022-04-28 05:51:37,055 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -362795852, now seen corresponding path program 2 times [2022-04-28 05:51:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:37,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295000154] [2022-04-28 05:51:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:37,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:37,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259503653] [2022-04-28 05:51:37,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:37,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:37,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:37,065 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:51:37,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 05:51:37,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:37,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:37,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 05:51:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:37,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:37,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {72484#true} call ULTIMATE.init(); {72484#true} is VALID [2022-04-28 05:51:37,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {72484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {72484#true} is VALID [2022-04-28 05:51:37,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72484#true} {72484#true} #108#return; {72484#true} is VALID [2022-04-28 05:51:37,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {72484#true} call #t~ret9 := main(); {72484#true} is VALID [2022-04-28 05:51:37,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {72484#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;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; {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {72484#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {72484#true} {72484#true} #94#return; {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {72484#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,917 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {72484#true} {72484#true} #96#return; {72484#true} is VALID [2022-04-28 05:51:37,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {72484#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {72537#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {72537#(and (= main_~r~0 0) (= 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; {72537#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {72537#(and (= main_~r~0 0) (= 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; {72537#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {72537#(and (= main_~r~0 0) (= 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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {72547#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {72547#(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; {72547#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {72547#(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; {72547#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {72547#(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);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,921 INFO L272 TraceCheckUtils]: 25: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {72484#true} is VALID [2022-04-28 05:51:37,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,922 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {72484#true} {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #98#return; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,922 INFO L272 TraceCheckUtils]: 30: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {72484#true} is VALID [2022-04-28 05:51:37,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,923 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {72484#true} {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,923 INFO L272 TraceCheckUtils]: 35: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {72484#true} is VALID [2022-04-28 05:51:37,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,924 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {72484#true} {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,924 INFO L272 TraceCheckUtils]: 40: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:37,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,925 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {72484#true} {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,926 INFO L290 TraceCheckUtils]: 46: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,926 INFO L290 TraceCheckUtils]: 47: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,927 INFO L272 TraceCheckUtils]: 48: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {72484#true} is VALID [2022-04-28 05:51:37,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,927 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {72484#true} {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #98#return; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,927 INFO L272 TraceCheckUtils]: 53: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {72484#true} is VALID [2022-04-28 05:51:37,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {72484#true} ~cond := #in~cond; {72655#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:37,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {72655#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:37,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:37,929 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,929 INFO L272 TraceCheckUtils]: 58: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {72484#true} is VALID [2022-04-28 05:51:37,929 INFO L290 TraceCheckUtils]: 59: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,930 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {72484#true} {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,930 INFO L272 TraceCheckUtils]: 63: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:37,930 INFO L290 TraceCheckUtils]: 64: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:37,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:37,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:37,931 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {72484#true} {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,932 INFO L290 TraceCheckUtils]: 69: Hoare triple {72627#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,932 INFO L290 TraceCheckUtils]: 70: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,932 INFO L290 TraceCheckUtils]: 71: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:37,933 INFO L290 TraceCheckUtils]: 73: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= 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; {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:51:37,934 INFO L290 TraceCheckUtils]: 74: Hoare triple {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:51:37,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:51:37,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {72725#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~x~0 (* (- 2) main_~a~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:51:37,935 INFO L272 TraceCheckUtils]: 77: Hoare triple {72725#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~x~0 (* (- 2) main_~a~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:37,936 INFO L290 TraceCheckUtils]: 78: Hoare triple {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {72733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:37,936 INFO L290 TraceCheckUtils]: 79: Hoare triple {72733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {72485#false} is VALID [2022-04-28 05:51:37,936 INFO L290 TraceCheckUtils]: 80: Hoare triple {72485#false} assume !false; {72485#false} is VALID [2022-04-28 05:51:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-28 05:51:37,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:50,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {72485#false} assume !false; {72485#false} is VALID [2022-04-28 05:51:50,194 INFO L290 TraceCheckUtils]: 79: Hoare triple {72733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {72485#false} is VALID [2022-04-28 05:51:50,194 INFO L290 TraceCheckUtils]: 78: Hoare triple {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {72733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:50,195 INFO L272 TraceCheckUtils]: 77: Hoare triple {72749#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:50,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {72749#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:50,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:51:50,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:51:50,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~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; {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:51:50,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,415 INFO L290 TraceCheckUtils]: 71: Hoare triple {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,456 INFO L290 TraceCheckUtils]: 69: Hoare triple {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,457 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {72484#true} {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,458 INFO L272 TraceCheckUtils]: 63: Hoare triple {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,458 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {72484#true} {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,459 INFO L272 TraceCheckUtils]: 58: Hoare triple {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {72484#true} is VALID [2022-04-28 05:51:50,460 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:50,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {72823#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:50,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {72484#true} ~cond := #in~cond; {72823#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:51:50,461 INFO L272 TraceCheckUtils]: 53: Hoare triple {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {72484#true} is VALID [2022-04-28 05:51:50,461 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {72484#true} {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,462 INFO L272 TraceCheckUtils]: 48: Hoare triple {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {72484#true} is VALID [2022-04-28 05:51:50,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 10);havoc #t~post8; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,704 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {72484#true} {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #104#return; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,705 INFO L272 TraceCheckUtils]: 40: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,705 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {72484#true} {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #102#return; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,706 INFO L272 TraceCheckUtils]: 35: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,706 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {72484#true} {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #100#return; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,707 INFO L272 TraceCheckUtils]: 30: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,707 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {72484#true} {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #98#return; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,708 INFO L272 TraceCheckUtils]: 25: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !!(#t~post8 < 10);havoc #t~post8; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {72851#(or (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:51:50,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !!(#t~post7 < 10);havoc #t~post7; {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:51:50,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:51:50,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:51:50,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post6 < 10);havoc #t~post6; {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {72484#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:51:50,713 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {72484#true} {72484#true} #96#return; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L272 TraceCheckUtils]: 11: Hoare triple {72484#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {72484#true} {72484#true} #94#return; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {72484#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {72484#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;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; {72484#true} is VALID [2022-04-28 05:51:50,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {72484#true} call #t~ret9 := main(); {72484#true} is VALID [2022-04-28 05:51:50,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72484#true} {72484#true} #108#return; {72484#true} is VALID [2022-04-28 05:51:50,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 05:51:50,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {72484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {72484#true} is VALID [2022-04-28 05:51:50,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {72484#true} call ULTIMATE.init(); {72484#true} is VALID [2022-04-28 05:51:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-28 05:51:50,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:50,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295000154] [2022-04-28 05:51:50,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:50,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259503653] [2022-04-28 05:51:50,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259503653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:50,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:50,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-28 05:51:50,715 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:50,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377522727] [2022-04-28 05:51:50,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377522727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:50,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:50,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:51:50,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530756257] [2022-04-28 05:51:50,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:50,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 81 [2022-04-28 05:51:50,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:50,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:51:50,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:50,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:51:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:51:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:51:50,777 INFO L87 Difference]: Start difference. First operand 947 states and 1263 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:51:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:55,579 INFO L93 Difference]: Finished difference Result 1025 states and 1371 transitions. [2022-04-28 05:51:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:51:55,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 81 [2022-04-28 05:51:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:51:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2022-04-28 05:51:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:51:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2022-04-28 05:51:55,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 162 transitions. [2022-04-28 05:51:55,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:55,828 INFO L225 Difference]: With dead ends: 1025 [2022-04-28 05:51:55,828 INFO L226 Difference]: Without dead ends: 1022 [2022-04-28 05:51:55,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2022-04-28 05:51:55,829 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:55,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 422 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 05:51:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-04-28 05:51:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 957. [2022-04-28 05:51:57,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:57,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1022 states. Second operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:51:57,264 INFO L74 IsIncluded]: Start isIncluded. First operand 1022 states. Second operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:51:57,264 INFO L87 Difference]: Start difference. First operand 1022 states. Second operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:51:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:57,305 INFO L93 Difference]: Finished difference Result 1022 states and 1364 transitions. [2022-04-28 05:51:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1364 transitions. [2022-04-28 05:51:57,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:57,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:57,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 1022 states. [2022-04-28 05:51:57,308 INFO L87 Difference]: Start difference. First operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 1022 states. [2022-04-28 05:51:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:57,345 INFO L93 Difference]: Finished difference Result 1022 states and 1364 transitions. [2022-04-28 05:51:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1364 transitions. [2022-04-28 05:51:57,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:57,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:57,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:57,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:51:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1272 transitions. [2022-04-28 05:51:57,404 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1272 transitions. Word has length 81 [2022-04-28 05:51:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:57,404 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1272 transitions. [2022-04-28 05:51:57,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:51:57,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1272 transitions. [2022-04-28 05:51:59,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1272 edges. 1272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1272 transitions. [2022-04-28 05:51:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 05:51:59,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:59,399 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:51:59,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 05:51:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 05:51:59,615 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2112645673, now seen corresponding path program 1 times [2022-04-28 05:51:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:59,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839516124] [2022-04-28 05:51:59,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2112645673, now seen corresponding path program 2 times [2022-04-28 05:51:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:59,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050487133] [2022-04-28 05:51:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:59,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:59,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989400933] [2022-04-28 05:51:59,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:59,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:59,629 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:51:59,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 05:51:59,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:59,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:59,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:51:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:59,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:59,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {79013#true} call ULTIMATE.init(); {79013#true} is VALID [2022-04-28 05:51:59,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {79013#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {79021#(<= ~counter~0 0)} assume true; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79021#(<= ~counter~0 0)} {79013#true} #108#return; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {79021#(<= ~counter~0 0)} call #t~ret9 := main(); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {79021#(<= ~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;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; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {79021#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {79021#(<= ~counter~0 0)} ~cond := #in~cond; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {79021#(<= ~counter~0 0)} assume !(0 == ~cond); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {79021#(<= ~counter~0 0)} assume true; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79021#(<= ~counter~0 0)} {79021#(<= ~counter~0 0)} #94#return; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {79021#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {79021#(<= ~counter~0 0)} ~cond := #in~cond; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {79021#(<= ~counter~0 0)} assume !(0 == ~cond); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {79021#(<= ~counter~0 0)} assume true; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79021#(<= ~counter~0 0)} {79021#(<= ~counter~0 0)} #96#return; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {79021#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:59,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {79021#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79070#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:59,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {79070#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {79070#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:59,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {79070#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79070#(<= ~counter~0 1)} is VALID [2022-04-28 05:51:59,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {79070#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:59,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {79080#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:59,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {79080#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:59,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {79080#(<= ~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; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:59,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {79080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:59,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {79093#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:59,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {79093#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:59,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {79093#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:59,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {79103#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:59,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {79103#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:59,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {79103#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {79113#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,958 INFO L272 TraceCheckUtils]: 32: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,959 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #98#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,960 INFO L272 TraceCheckUtils]: 37: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,960 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #100#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,961 INFO L272 TraceCheckUtils]: 42: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,962 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #102#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,962 INFO L272 TraceCheckUtils]: 47: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,963 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #104#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {79113#(<= ~counter~0 5)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:51:59,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {79113#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {79183#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,964 INFO L272 TraceCheckUtils]: 55: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,965 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #98#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,965 INFO L272 TraceCheckUtils]: 60: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,966 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #100#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,967 INFO L272 TraceCheckUtils]: 65: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,967 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #102#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,968 INFO L272 TraceCheckUtils]: 70: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,969 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #104#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {79183#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {79183#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:51:59,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {79183#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:59,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {79256#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:59,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {79256#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:59,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {79256#(<= ~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; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:51:59,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {79256#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79269#(<= |main_#t~post6| 7)} is VALID [2022-04-28 05:51:59,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {79269#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {79014#false} is VALID [2022-04-28 05:51:59,971 INFO L272 TraceCheckUtils]: 83: Hoare triple {79014#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {79014#false} is VALID [2022-04-28 05:51:59,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {79014#false} ~cond := #in~cond; {79014#false} is VALID [2022-04-28 05:51:59,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {79014#false} assume 0 == ~cond; {79014#false} is VALID [2022-04-28 05:51:59,971 INFO L290 TraceCheckUtils]: 86: Hoare triple {79014#false} assume !false; {79014#false} is VALID [2022-04-28 05:51:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 88 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:51:59,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:52:00,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {79014#false} assume !false; {79014#false} is VALID [2022-04-28 05:52:00,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {79014#false} assume 0 == ~cond; {79014#false} is VALID [2022-04-28 05:52:00,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {79014#false} ~cond := #in~cond; {79014#false} is VALID [2022-04-28 05:52:00,202 INFO L272 TraceCheckUtils]: 83: Hoare triple {79014#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {79014#false} is VALID [2022-04-28 05:52:00,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {79297#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {79014#false} is VALID [2022-04-28 05:52:00,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {79301#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79297#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:52:00,205 INFO L290 TraceCheckUtils]: 80: Hoare triple {79301#(< ~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; {79301#(< ~counter~0 10)} is VALID [2022-04-28 05:52:00,205 INFO L290 TraceCheckUtils]: 79: Hoare triple {79301#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {79301#(< ~counter~0 10)} is VALID [2022-04-28 05:52:00,205 INFO L290 TraceCheckUtils]: 78: Hoare triple {79301#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {79301#(< ~counter~0 10)} is VALID [2022-04-28 05:52:00,207 INFO L290 TraceCheckUtils]: 77: Hoare triple {79314#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79301#(< ~counter~0 10)} is VALID [2022-04-28 05:52:00,207 INFO L290 TraceCheckUtils]: 76: Hoare triple {79314#(< ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,207 INFO L290 TraceCheckUtils]: 75: Hoare triple {79314#(< ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,207 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #104#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L290 TraceCheckUtils]: 71: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L272 TraceCheckUtils]: 70: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #102#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,208 INFO L272 TraceCheckUtils]: 65: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,209 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #100#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,209 INFO L272 TraceCheckUtils]: 60: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,209 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #98#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,210 INFO L272 TraceCheckUtils]: 55: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {79314#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,210 INFO L290 TraceCheckUtils]: 53: Hoare triple {79256#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79314#(< ~counter~0 9)} is VALID [2022-04-28 05:52:00,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {79256#(<= ~counter~0 7)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,211 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #104#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,211 INFO L272 TraceCheckUtils]: 47: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #102#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L272 TraceCheckUtils]: 42: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #100#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,212 INFO L272 TraceCheckUtils]: 37: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,213 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #98#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,213 INFO L272 TraceCheckUtils]: 32: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {79256#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {79183#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 05:52:00,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {79183#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:52:00,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {79183#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:52:00,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {79113#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 05:52:00,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {79113#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:52:00,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {79113#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:52:00,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {79103#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 05:52:00,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {79103#(<= ~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; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:52:00,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {79103#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:52:00,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {79103#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:52:00,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {79093#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 05:52:00,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {79093#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 05:52:00,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {79093#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 05:52:00,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {79080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 05:52:00,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {79080#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,220 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79013#true} {79080#(<= ~counter~0 2)} #96#return; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,221 INFO L272 TraceCheckUtils]: 11: Hoare triple {79080#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79013#true} {79080#(<= ~counter~0 2)} #94#return; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 05:52:00,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 05:52:00,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 05:52:00,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {79080#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {79013#true} is VALID [2022-04-28 05:52:00,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {79080#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {79080#(<= ~counter~0 2)} call #t~ret9 := main(); {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79080#(<= ~counter~0 2)} {79013#true} #108#return; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {79080#(<= ~counter~0 2)} assume true; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {79013#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 05:52:00,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {79013#true} call ULTIMATE.init(); {79013#true} is VALID [2022-04-28 05:52:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:52:00,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:52:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050487133] [2022-04-28 05:52:00,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:52:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989400933] [2022-04-28 05:52:00,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989400933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:52:00,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:52:00,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 05:52:00,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:52:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839516124] [2022-04-28 05:52:00,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839516124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:00,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:00,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:52:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958315370] [2022-04-28 05:52:00,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:52:00,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 87 [2022-04-28 05:52:00,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:52:00,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:52:00,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:52:00,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:52:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:52:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:52:00,262 INFO L87 Difference]: Start difference. First operand 957 states and 1272 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:52:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:02,129 INFO L93 Difference]: Finished difference Result 966 states and 1279 transitions. [2022-04-28 05:52:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:52:02,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 87 [2022-04-28 05:52:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:52:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:52:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 180 transitions. [2022-04-28 05:52:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:52:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 180 transitions. [2022-04-28 05:52:02,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 180 transitions. [2022-04-28 05:52:02,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:52:02,292 INFO L225 Difference]: With dead ends: 966 [2022-04-28 05:52:02,292 INFO L226 Difference]: Without dead ends: 959 [2022-04-28 05:52:02,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2022-04-28 05:52:02,293 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 122 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:52:02,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 261 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:52:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-04-28 05:52:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2022-04-28 05:52:03,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:52:03,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 959 states. Second operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:52:03,990 INFO L74 IsIncluded]: Start isIncluded. First operand 959 states. Second operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:52:03,990 INFO L87 Difference]: Start difference. First operand 959 states. Second operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:52:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:04,023 INFO L93 Difference]: Finished difference Result 959 states and 1271 transitions. [2022-04-28 05:52:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1271 transitions. [2022-04-28 05:52:04,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:04,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:04,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 959 states. [2022-04-28 05:52:04,026 INFO L87 Difference]: Start difference. First operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 959 states. [2022-04-28 05:52:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:04,056 INFO L93 Difference]: Finished difference Result 959 states and 1271 transitions. [2022-04-28 05:52:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1271 transitions. [2022-04-28 05:52:04,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:04,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:04,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:52:04,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:52:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 05:52:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1270 transitions. [2022-04-28 05:52:04,098 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1270 transitions. Word has length 87 [2022-04-28 05:52:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:52:04,099 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1270 transitions. [2022-04-28 05:52:04,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:52:04,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1270 transitions. [2022-04-28 05:52:06,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1270 edges. 1270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:52:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1270 transitions. [2022-04-28 05:52:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 05:52:06,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:52:06,495 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:52:06,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 05:52:06,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:52:06,696 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:52:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:52:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523945, now seen corresponding path program 3 times [2022-04-28 05:52:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202675258] [2022-04-28 05:52:06,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:52:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523945, now seen corresponding path program 4 times [2022-04-28 05:52:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:52:06,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222900951] [2022-04-28 05:52:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:52:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:52:06,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:52:06,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232471235] [2022-04-28 05:52:06,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:52:06,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:52:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:52:06,707 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:52:06,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 05:52:06,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:52:06,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:52:06,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 05:52:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:06,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:52:37,877 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:52:42,893 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:52:47,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {85322#true} call ULTIMATE.init(); {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {85322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85322#true} {85322#true} #108#return; {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {85322#true} call #t~ret9 := main(); {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {85322#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;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; {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {85322#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85322#true} {85322#true} #94#return; {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L272 TraceCheckUtils]: 11: Hoare triple {85322#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85322#true} {85322#true} #96#return; {85322#true} is VALID [2022-04-28 05:52:47,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {85322#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {85375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {85375#(and (= main_~r~0 0) (= 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; {85375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {85375#(and (= main_~r~0 0) (= 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; {85375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {85375#(and (= main_~r~0 0) (= 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);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {85385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {85385#(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; {85385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {85385#(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; {85385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {85385#(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); {85385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {85385#(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; {85398#(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_~q~0 1))} is VALID [2022-04-28 05:52:47,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {85398#(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_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85398#(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_~q~0 1))} is VALID [2022-04-28 05:52:47,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {85398#(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_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {85398#(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_~q~0 1))} is VALID [2022-04-28 05:52:47,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {85398#(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_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {85408#(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) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {85408#(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) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85408#(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) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {85408#(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) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {85408#(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) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {85408#(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) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,821 INFO L272 TraceCheckUtils]: 32: Hoare triple {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {85322#true} ~cond := #in~cond; {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:47,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:47,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:47,822 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} {85418#(and (= main_~b~0 main_~v~0) (= 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) (= main_~q~0 1))} #98#return; {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,822 INFO L272 TraceCheckUtils]: 37: Hoare triple {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,823 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {85322#true} {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,823 INFO L272 TraceCheckUtils]: 42: Hoare triple {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~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)); {85322#true} is VALID [2022-04-28 05:52:47,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,824 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {85322#true} {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,824 INFO L272 TraceCheckUtils]: 47: Hoare triple {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,825 INFO L290 TraceCheckUtils]: 49: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,825 INFO L290 TraceCheckUtils]: 50: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,825 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {85322#true} {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {85442#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post8 < 10);havoc #t~post8; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,828 INFO L272 TraceCheckUtils]: 55: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~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)); {85322#true} is VALID [2022-04-28 05:52:47,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,829 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {85322#true} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #98#return; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,829 INFO L272 TraceCheckUtils]: 60: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {85322#true} ~cond := #in~cond; {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:47,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:47,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:47,830 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,830 INFO L272 TraceCheckUtils]: 65: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~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)); {85322#true} is VALID [2022-04-28 05:52:47,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 05:52:47,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 05:52:47,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 05:52:47,831 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {85322#true} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,831 INFO L272 TraceCheckUtils]: 70: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 05:52:47,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {85322#true} ~cond := #in~cond; {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:47,832 INFO L290 TraceCheckUtils]: 72: Hoare triple {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:47,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:47,833 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,834 INFO L290 TraceCheckUtils]: 75: Hoare triple {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:52:47,836 INFO L290 TraceCheckUtils]: 76: Hoare triple {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,838 INFO L290 TraceCheckUtils]: 79: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:52:47,842 INFO L290 TraceCheckUtils]: 80: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} is VALID [2022-04-28 05:52:47,844 INFO L290 TraceCheckUtils]: 81: Hoare triple {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} is VALID [2022-04-28 05:52:47,845 INFO L290 TraceCheckUtils]: 82: Hoare triple {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} assume !!(#t~post6 < 10);havoc #t~post6; {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} is VALID [2022-04-28 05:52:47,846 INFO L290 TraceCheckUtils]: 83: Hoare triple {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} assume !(0 != ~b~0); {85588#(and (= main_~r~0 0) (or (and (= main_~a~0 0) (= (div main_~y~0 2) 0) (= (mod main_~y~0 2) 0) (= (mod main_~q~0 2) 0)) (and (= main_~y~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2)) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0))) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:47,850 INFO L272 TraceCheckUtils]: 84: Hoare triple {85588#(and (= main_~r~0 0) (or (and (= main_~a~0 0) (= (div main_~y~0 2) 0) (= (mod main_~y~0 2) 0) (= (mod main_~q~0 2) 0)) (and (= main_~y~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2)) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0))) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {85592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:52:47,851 INFO L290 TraceCheckUtils]: 85: Hoare triple {85592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {85596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:47,851 INFO L290 TraceCheckUtils]: 86: Hoare triple {85596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {85323#false} is VALID [2022-04-28 05:52:47,851 INFO L290 TraceCheckUtils]: 87: Hoare triple {85323#false} assume !false; {85323#false} is VALID [2022-04-28 05:52:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 40 proven. 47 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-28 05:52:47,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:53:41,718 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:53:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:42,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222900951] [2022-04-28 05:53:42,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:42,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232471235] [2022-04-28 05:53:42,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232471235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:53:42,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:53:42,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 05:53:42,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:42,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202675258] [2022-04-28 05:53:42,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202675258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:42,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:42,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 05:53:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973896977] [2022-04-28 05:53:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-04-28 05:53:42,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:42,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:53:42,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:53:42,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 05:53:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 05:53:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-28 05:53:42,984 INFO L87 Difference]: Start difference. First operand 957 states and 1270 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:53:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:53,049 INFO L93 Difference]: Finished difference Result 1069 states and 1430 transitions. [2022-04-28 05:53:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:53:53,049 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-04-28 05:53:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:53:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 202 transitions. [2022-04-28 05:53:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:53:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 202 transitions. [2022-04-28 05:53:53,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 202 transitions. [2022-04-28 05:53:53,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:53:53,380 INFO L225 Difference]: With dead ends: 1069 [2022-04-28 05:53:53,380 INFO L226 Difference]: Without dead ends: 1066 [2022-04-28 05:53:53,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2022-04-28 05:53:53,380 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 91 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:53:53,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 726 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 05:53:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-04-28 05:53:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1023. [2022-04-28 05:53:55,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:55,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:53:55,038 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:53:55,039 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:53:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:55,076 INFO L93 Difference]: Finished difference Result 1066 states and 1425 transitions. [2022-04-28 05:53:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1425 transitions. [2022-04-28 05:53:55,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:55,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:55,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1066 states. [2022-04-28 05:53:55,079 INFO L87 Difference]: Start difference. First operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1066 states. [2022-04-28 05:53:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:55,113 INFO L93 Difference]: Finished difference Result 1066 states and 1425 transitions. [2022-04-28 05:53:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1425 transitions. [2022-04-28 05:53:55,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:55,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:55,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:55,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:53:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1372 transitions. [2022-04-28 05:53:55,160 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1372 transitions. Word has length 88 [2022-04-28 05:53:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:55,160 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1372 transitions. [2022-04-28 05:53:55,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:53:55,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1372 transitions. [2022-04-28 05:53:57,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1372 edges. 1372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:53:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1372 transitions. [2022-04-28 05:53:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 05:53:57,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:57,635 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 2, 2, 2, 2, 2, 2, 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] [2022-04-28 05:53:57,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 05:53:57,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 05:53:57,851 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1791236545, now seen corresponding path program 5 times [2022-04-28 05:53:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:57,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49315577] [2022-04-28 05:53:57,857 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1791236545, now seen corresponding path program 6 times [2022-04-28 05:53:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:57,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663001462] [2022-04-28 05:53:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:57,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:57,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118568639] [2022-04-28 05:53:57,868 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:53:57,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:57,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:57,869 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:53:57,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 05:53:57,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:53:57,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:57,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:53:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:57,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:58,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {92051#true} call ULTIMATE.init(); {92051#true} is VALID [2022-04-28 05:53:58,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {92051#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {92059#(<= ~counter~0 0)} assume true; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92059#(<= ~counter~0 0)} {92051#true} #108#return; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {92059#(<= ~counter~0 0)} call #t~ret9 := main(); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {92059#(<= ~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;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; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,363 INFO L272 TraceCheckUtils]: 6: Hoare triple {92059#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {92059#(<= ~counter~0 0)} ~cond := #in~cond; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {92059#(<= ~counter~0 0)} assume !(0 == ~cond); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {92059#(<= ~counter~0 0)} assume true; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92059#(<= ~counter~0 0)} {92059#(<= ~counter~0 0)} #94#return; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,364 INFO L272 TraceCheckUtils]: 11: Hoare triple {92059#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {92059#(<= ~counter~0 0)} ~cond := #in~cond; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {92059#(<= ~counter~0 0)} assume !(0 == ~cond); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {92059#(<= ~counter~0 0)} assume true; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,365 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92059#(<= ~counter~0 0)} {92059#(<= ~counter~0 0)} #96#return; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {92059#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 05:53:58,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {92059#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {92108#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {92108#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {92108#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 05:53:58,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {92118#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 05:53:58,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {92118#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 05:53:58,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {92118#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {92128#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,370 INFO L272 TraceCheckUtils]: 25: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,371 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #98#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,372 INFO L272 TraceCheckUtils]: 30: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,373 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #100#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,374 INFO L272 TraceCheckUtils]: 35: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,375 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #102#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,375 INFO L272 TraceCheckUtils]: 40: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,376 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #104#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {92128#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {92128#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {92128#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {92201#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {92201#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {92201#(<= ~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; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {92201#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {92214#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {92214#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {92214#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 05:53:58,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {92224#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 05:53:58,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {92224#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 05:53:58,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {92224#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {92234#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,382 INFO L272 TraceCheckUtils]: 59: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,384 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #98#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,384 INFO L272 TraceCheckUtils]: 64: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,385 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #100#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,386 INFO L272 TraceCheckUtils]: 69: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,387 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #102#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,387 INFO L272 TraceCheckUtils]: 74: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,388 INFO L290 TraceCheckUtils]: 76: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,388 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #104#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,389 INFO L290 TraceCheckUtils]: 79: Hoare triple {92234#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {92234#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,390 INFO L290 TraceCheckUtils]: 81: Hoare triple {92234#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,390 INFO L290 TraceCheckUtils]: 82: Hoare triple {92307#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {92307#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {92307#(<= ~counter~0 8)} ~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; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {92307#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92320#(<= |main_#t~post6| 8)} is VALID [2022-04-28 05:53:58,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {92320#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {92052#false} is VALID [2022-04-28 05:53:58,391 INFO L272 TraceCheckUtils]: 87: Hoare triple {92052#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {92052#false} is VALID [2022-04-28 05:53:58,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {92052#false} ~cond := #in~cond; {92052#false} is VALID [2022-04-28 05:53:58,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {92052#false} assume 0 == ~cond; {92052#false} is VALID [2022-04-28 05:53:58,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {92052#false} assume !false; {92052#false} is VALID [2022-04-28 05:53:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:53:58,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:53:58,641 INFO L290 TraceCheckUtils]: 90: Hoare triple {92052#false} assume !false; {92052#false} is VALID [2022-04-28 05:53:58,641 INFO L290 TraceCheckUtils]: 89: Hoare triple {92052#false} assume 0 == ~cond; {92052#false} is VALID [2022-04-28 05:53:58,641 INFO L290 TraceCheckUtils]: 88: Hoare triple {92052#false} ~cond := #in~cond; {92052#false} is VALID [2022-04-28 05:53:58,641 INFO L272 TraceCheckUtils]: 87: Hoare triple {92052#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {92052#false} is VALID [2022-04-28 05:53:58,641 INFO L290 TraceCheckUtils]: 86: Hoare triple {92348#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {92052#false} is VALID [2022-04-28 05:53:58,641 INFO L290 TraceCheckUtils]: 85: Hoare triple {92352#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92348#(< |main_#t~post6| 10)} is VALID [2022-04-28 05:53:58,641 INFO L290 TraceCheckUtils]: 84: Hoare triple {92352#(< ~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; {92352#(< ~counter~0 10)} is VALID [2022-04-28 05:53:58,642 INFO L290 TraceCheckUtils]: 83: Hoare triple {92352#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {92352#(< ~counter~0 10)} is VALID [2022-04-28 05:53:58,642 INFO L290 TraceCheckUtils]: 82: Hoare triple {92352#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {92352#(< ~counter~0 10)} is VALID [2022-04-28 05:53:58,643 INFO L290 TraceCheckUtils]: 81: Hoare triple {92307#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92352#(< ~counter~0 10)} is VALID [2022-04-28 05:53:58,644 INFO L290 TraceCheckUtils]: 80: Hoare triple {92307#(<= ~counter~0 8)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,644 INFO L290 TraceCheckUtils]: 79: Hoare triple {92307#(<= ~counter~0 8)} assume !(~c~0 >= 2 * ~v~0); {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,644 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #104#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,644 INFO L290 TraceCheckUtils]: 77: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,644 INFO L290 TraceCheckUtils]: 76: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,644 INFO L290 TraceCheckUtils]: 75: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,644 INFO L272 TraceCheckUtils]: 74: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #102#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L272 TraceCheckUtils]: 69: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #100#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,645 INFO L290 TraceCheckUtils]: 67: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L290 TraceCheckUtils]: 66: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,645 INFO L290 TraceCheckUtils]: 65: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,646 INFO L272 TraceCheckUtils]: 64: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,646 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #98#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,646 INFO L272 TraceCheckUtils]: 59: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {92307#(<= ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {92234#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 05:53:58,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {92234#(<= ~counter~0 7)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {92234#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,648 INFO L290 TraceCheckUtils]: 54: Hoare triple {92224#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 05:53:58,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {92224#(<= ~counter~0 6)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 05:53:58,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {92224#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 05:53:58,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {92214#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 05:53:58,649 INFO L290 TraceCheckUtils]: 50: Hoare triple {92214#(<= ~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; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {92214#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {92214#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {92201#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 05:53:58,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {92201#(<= ~counter~0 4)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {92201#(<= ~counter~0 4)} assume !(~c~0 >= 2 * ~v~0); {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,651 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #104#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,651 INFO L290 TraceCheckUtils]: 41: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,651 INFO L272 TraceCheckUtils]: 40: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #102#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L272 TraceCheckUtils]: 35: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #100#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,652 INFO L272 TraceCheckUtils]: 30: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,653 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #98#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,653 INFO L272 TraceCheckUtils]: 25: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {92201#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {92128#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 05:53:58,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {92128#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {92128#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {92118#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 05:53:58,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {92118#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 05:53:58,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {92118#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 05:53:58,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {92108#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 05:53:58,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {92108#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92051#true} {92108#(<= ~counter~0 1)} #96#return; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L272 TraceCheckUtils]: 11: Hoare triple {92108#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92051#true} {92108#(<= ~counter~0 1)} #94#return; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {92108#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92051#true} is VALID [2022-04-28 05:53:58,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {92108#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {92108#(<= ~counter~0 1)} call #t~ret9 := main(); {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92108#(<= ~counter~0 1)} {92051#true} #108#return; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {92108#(<= ~counter~0 1)} assume true; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {92051#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 05:53:58,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {92051#true} call ULTIMATE.init(); {92051#true} is VALID [2022-04-28 05:53:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:53:58,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663001462] [2022-04-28 05:53:58,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118568639] [2022-04-28 05:53:58,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118568639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:53:58,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:53:58,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 05:53:58,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49315577] [2022-04-28 05:53:58,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49315577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:58,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:58,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:53:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340502016] [2022-04-28 05:53:58,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:58,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2022-04-28 05:53:58,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:58,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:53:58,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:53:58,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:53:58,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:53:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:53:58,702 INFO L87 Difference]: Start difference. First operand 1023 states and 1372 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:00,835 INFO L93 Difference]: Finished difference Result 1058 states and 1407 transitions. [2022-04-28 05:54:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 05:54:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2022-04-28 05:54:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 208 transitions. [2022-04-28 05:54:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 208 transitions. [2022-04-28 05:54:00,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 208 transitions. [2022-04-28 05:54:00,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:01,024 INFO L225 Difference]: With dead ends: 1058 [2022-04-28 05:54:01,025 INFO L226 Difference]: Without dead ends: 1051 [2022-04-28 05:54:01,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=240, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:54:01,026 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:01,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 287 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:54:01,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2022-04-28 05:54:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1034. [2022-04-28 05:54:02,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:02,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1051 states. Second operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:02,580 INFO L74 IsIncluded]: Start isIncluded. First operand 1051 states. Second operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:02,580 INFO L87 Difference]: Start difference. First operand 1051 states. Second operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:02,644 INFO L93 Difference]: Finished difference Result 1051 states and 1398 transitions. [2022-04-28 05:54:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1398 transitions. [2022-04-28 05:54:02,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:02,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:02,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1051 states. [2022-04-28 05:54:02,648 INFO L87 Difference]: Start difference. First operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1051 states. [2022-04-28 05:54:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:02,682 INFO L93 Difference]: Finished difference Result 1051 states and 1398 transitions. [2022-04-28 05:54:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1398 transitions. [2022-04-28 05:54:02,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:02,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:02,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:02,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1383 transitions. [2022-04-28 05:54:02,730 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1383 transitions. Word has length 91 [2022-04-28 05:54:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:02,731 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1383 transitions. [2022-04-28 05:54:02,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:02,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1034 states and 1383 transitions. [2022-04-28 05:54:05,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1383 edges. 1383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1383 transitions. [2022-04-28 05:54:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 05:54:05,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:05,550 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 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, 1] [2022-04-28 05:54:05,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 05:54:05,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:05,763 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash -554609469, now seen corresponding path program 1 times [2022-04-28 05:54:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113388961] [2022-04-28 05:54:05,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash -554609469, now seen corresponding path program 2 times [2022-04-28 05:54:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:05,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155030456] [2022-04-28 05:54:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:05,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:05,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100899779] [2022-04-28 05:54:05,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:54:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:05,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:05,808 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:54:05,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 05:54:05,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:54:05,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:05,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:54:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:05,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:06,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {98908#true} call ULTIMATE.init(); {98908#true} is VALID [2022-04-28 05:54:06,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {98908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {98916#(<= ~counter~0 0)} assume true; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98916#(<= ~counter~0 0)} {98908#true} #108#return; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {98916#(<= ~counter~0 0)} call #t~ret9 := main(); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {98916#(<= ~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;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; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {98916#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {98916#(<= ~counter~0 0)} ~cond := #in~cond; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {98916#(<= ~counter~0 0)} assume !(0 == ~cond); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {98916#(<= ~counter~0 0)} assume true; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {98916#(<= ~counter~0 0)} {98916#(<= ~counter~0 0)} #94#return; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,335 INFO L272 TraceCheckUtils]: 11: Hoare triple {98916#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {98916#(<= ~counter~0 0)} ~cond := #in~cond; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {98916#(<= ~counter~0 0)} assume !(0 == ~cond); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {98916#(<= ~counter~0 0)} assume true; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,336 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {98916#(<= ~counter~0 0)} {98916#(<= ~counter~0 0)} #96#return; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {98916#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:06,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {98916#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {98965#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {98965#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {98965#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {98975#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {98975#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {98975#(<= ~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; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {98975#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {98988#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {98988#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {98988#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:06,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {98998#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:06,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {98998#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:06,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {98998#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {99008#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,344 INFO L272 TraceCheckUtils]: 32: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,346 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #98#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,346 INFO L272 TraceCheckUtils]: 37: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,347 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #100#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,348 INFO L272 TraceCheckUtils]: 42: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,349 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #102#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,350 INFO L272 TraceCheckUtils]: 47: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,351 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #104#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {99008#(<= ~counter~0 5)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {99008#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {99078#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,353 INFO L272 TraceCheckUtils]: 55: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,354 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #98#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,355 INFO L272 TraceCheckUtils]: 60: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,356 INFO L290 TraceCheckUtils]: 63: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,356 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #100#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,357 INFO L272 TraceCheckUtils]: 65: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,357 INFO L290 TraceCheckUtils]: 67: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,357 INFO L290 TraceCheckUtils]: 68: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,358 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #102#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,358 INFO L272 TraceCheckUtils]: 70: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,360 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #104#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,360 INFO L290 TraceCheckUtils]: 75: Hoare triple {99078#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,360 INFO L290 TraceCheckUtils]: 76: Hoare triple {99078#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {99078#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {99151#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,362 INFO L290 TraceCheckUtils]: 79: Hoare triple {99151#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,362 INFO L290 TraceCheckUtils]: 80: Hoare triple {99151#(<= ~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; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {99151#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,363 INFO L290 TraceCheckUtils]: 82: Hoare triple {99164#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,363 INFO L290 TraceCheckUtils]: 83: Hoare triple {99164#(<= ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {99164#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99174#(<= |main_#t~post7| 8)} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {99174#(<= |main_#t~post7| 8)} assume !(#t~post7 < 10);havoc #t~post7; {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 86: Hoare triple {98909#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; {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 87: Hoare triple {98909#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 88: Hoare triple {98909#false} assume !(#t~post6 < 10);havoc #t~post6; {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L272 TraceCheckUtils]: 89: Hoare triple {98909#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 90: Hoare triple {98909#false} ~cond := #in~cond; {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {98909#false} assume 0 == ~cond; {98909#false} is VALID [2022-04-28 05:54:06,364 INFO L290 TraceCheckUtils]: 92: Hoare triple {98909#false} assume !false; {98909#false} is VALID [2022-04-28 05:54:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 96 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:54:06,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:06,723 INFO L290 TraceCheckUtils]: 92: Hoare triple {98909#false} assume !false; {98909#false} is VALID [2022-04-28 05:54:06,723 INFO L290 TraceCheckUtils]: 91: Hoare triple {98909#false} assume 0 == ~cond; {98909#false} is VALID [2022-04-28 05:54:06,723 INFO L290 TraceCheckUtils]: 90: Hoare triple {98909#false} ~cond := #in~cond; {98909#false} is VALID [2022-04-28 05:54:06,723 INFO L272 TraceCheckUtils]: 89: Hoare triple {98909#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {98909#false} is VALID [2022-04-28 05:54:06,723 INFO L290 TraceCheckUtils]: 88: Hoare triple {98909#false} assume !(#t~post6 < 10);havoc #t~post6; {98909#false} is VALID [2022-04-28 05:54:06,723 INFO L290 TraceCheckUtils]: 87: Hoare triple {98909#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98909#false} is VALID [2022-04-28 05:54:06,724 INFO L290 TraceCheckUtils]: 86: Hoare triple {98909#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; {98909#false} is VALID [2022-04-28 05:54:06,724 INFO L290 TraceCheckUtils]: 85: Hoare triple {99220#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {98909#false} is VALID [2022-04-28 05:54:06,724 INFO L290 TraceCheckUtils]: 84: Hoare triple {99224#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99220#(< |main_#t~post7| 10)} is VALID [2022-04-28 05:54:06,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {99224#(< ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {99224#(< ~counter~0 10)} is VALID [2022-04-28 05:54:06,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {99224#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {99224#(< ~counter~0 10)} is VALID [2022-04-28 05:54:06,726 INFO L290 TraceCheckUtils]: 81: Hoare triple {99164#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99224#(< ~counter~0 10)} is VALID [2022-04-28 05:54:06,727 INFO L290 TraceCheckUtils]: 80: Hoare triple {99164#(<= ~counter~0 8)} ~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; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {99164#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {99164#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,728 INFO L290 TraceCheckUtils]: 77: Hoare triple {99151#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:06,728 INFO L290 TraceCheckUtils]: 76: Hoare triple {99151#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {99151#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,729 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #104#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,729 INFO L290 TraceCheckUtils]: 73: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,729 INFO L290 TraceCheckUtils]: 71: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,729 INFO L272 TraceCheckUtils]: 70: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,730 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #102#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,730 INFO L290 TraceCheckUtils]: 68: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,730 INFO L272 TraceCheckUtils]: 65: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,731 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #100#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,731 INFO L290 TraceCheckUtils]: 62: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,731 INFO L272 TraceCheckUtils]: 60: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,731 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #98#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,732 INFO L272 TraceCheckUtils]: 55: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {99151#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {99078#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:06,733 INFO L290 TraceCheckUtils]: 52: Hoare triple {99078#(<= ~counter~0 6)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,734 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #104#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,734 INFO L272 TraceCheckUtils]: 47: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,734 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #102#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,735 INFO L272 TraceCheckUtils]: 42: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,735 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #100#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,735 INFO L272 TraceCheckUtils]: 37: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,736 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #98#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,736 INFO L272 TraceCheckUtils]: 32: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {99078#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {99008#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:06,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {99008#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {99008#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {98998#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:06,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {98998#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:06,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {98998#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:06,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {98988#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:06,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {98988#(<= ~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; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {98988#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {98988#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {98975#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:06,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {98975#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {98975#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {98965#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:06,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {98965#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,744 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {98908#true} {98965#(<= ~counter~0 1)} #96#return; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {98965#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {98908#true} {98965#(<= ~counter~0 1)} #94#return; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 05:54:06,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {98965#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {98908#true} is VALID [2022-04-28 05:54:06,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {98965#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~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; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {98965#(<= ~counter~0 1)} call #t~ret9 := main(); {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98965#(<= ~counter~0 1)} {98908#true} #108#return; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {98965#(<= ~counter~0 1)} assume true; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {98908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:06,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {98908#true} call ULTIMATE.init(); {98908#true} is VALID [2022-04-28 05:54:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:54:06,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155030456] [2022-04-28 05:54:06,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100899779] [2022-04-28 05:54:06,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100899779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:54:06,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:54:06,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 05:54:06,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113388961] [2022-04-28 05:54:06,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113388961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:06,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:06,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:54:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91626728] [2022-04-28 05:54:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-04-28 05:54:06,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:06,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:06,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:06,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:54:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:54:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:54:06,810 INFO L87 Difference]: Start difference. First operand 1034 states and 1383 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:10,411 INFO L93 Difference]: Finished difference Result 1378 states and 1899 transitions. [2022-04-28 05:54:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 05:54:10,411 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-04-28 05:54:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2022-04-28 05:54:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2022-04-28 05:54:10,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 233 transitions. [2022-04-28 05:54:10,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:10,667 INFO L225 Difference]: With dead ends: 1378 [2022-04-28 05:54:10,667 INFO L226 Difference]: Without dead ends: 1058 [2022-04-28 05:54:10,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:54:10,669 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 164 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:10,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 290 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:54:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-04-28 05:54:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1054. [2022-04-28 05:54:12,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:12,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1058 states. Second operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:12,618 INFO L74 IsIncluded]: Start isIncluded. First operand 1058 states. Second operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:12,619 INFO L87 Difference]: Start difference. First operand 1058 states. Second operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:12,652 INFO L93 Difference]: Finished difference Result 1058 states and 1404 transitions. [2022-04-28 05:54:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1404 transitions. [2022-04-28 05:54:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:12,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:12,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1058 states. [2022-04-28 05:54:12,655 INFO L87 Difference]: Start difference. First operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1058 states. [2022-04-28 05:54:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:12,688 INFO L93 Difference]: Finished difference Result 1058 states and 1404 transitions. [2022-04-28 05:54:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1404 transitions. [2022-04-28 05:54:12,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:12,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:12,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:12,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 05:54:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1402 transitions. [2022-04-28 05:54:12,737 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1402 transitions. Word has length 93 [2022-04-28 05:54:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:12,737 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1402 transitions. [2022-04-28 05:54:12,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:12,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1054 states and 1402 transitions. [2022-04-28 05:54:15,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1402 edges. 1402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1402 transitions. [2022-04-28 05:54:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 05:54:15,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:15,461 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 3, 3, 3, 2, 2, 2, 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] [2022-04-28 05:54:15,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 05:54:15,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:15,675 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2034142563, now seen corresponding path program 5 times [2022-04-28 05:54:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:15,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159505285] [2022-04-28 05:54:15,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2034142563, now seen corresponding path program 6 times [2022-04-28 05:54:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:15,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777647389] [2022-04-28 05:54:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:15,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:15,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716846957] [2022-04-28 05:54:15,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:54:15,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:15,688 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:54:15,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 05:54:15,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:54:15,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:15,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:54:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:15,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:16,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {106471#true} call ULTIMATE.init(); {106471#true} is VALID [2022-04-28 05:54:16,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {106471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106479#(<= ~counter~0 0)} {106471#true} #108#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {106479#(<= ~counter~0 0)} call #t~ret9 := main(); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {106479#(<= ~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;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; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {106479#(<= ~counter~0 0)} ~cond := #in~cond; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {106479#(<= ~counter~0 0)} assume !(0 == ~cond); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {106479#(<= ~counter~0 0)} {106479#(<= ~counter~0 0)} #94#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {106479#(<= ~counter~0 0)} ~cond := #in~cond; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {106479#(<= ~counter~0 0)} assume !(0 == ~cond); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106479#(<= ~counter~0 0)} {106479#(<= ~counter~0 0)} #96#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {106479#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {106479#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:16,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {106528#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:16,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {106528#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:16,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {106528#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {106538#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {106538#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(<= ~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; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {106538#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:16,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {106551#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:16,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {106551#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:16,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {106551#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:16,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {106561#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:16,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {106561#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:16,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {106561#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {106571#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,301 INFO L272 TraceCheckUtils]: 32: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,302 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #98#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,303 INFO L272 TraceCheckUtils]: 37: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,304 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #100#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,305 INFO L272 TraceCheckUtils]: 42: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,306 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #102#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,307 INFO L272 TraceCheckUtils]: 47: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,308 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #104#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {106571#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {106571#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {106571#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {106644#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {106644#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {106644#(<= ~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; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {106644#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:16,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {106657#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:16,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {106657#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:16,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {106657#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:16,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {106667#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:16,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {106667#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:16,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {106667#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {106677#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,315 INFO L272 TraceCheckUtils]: 66: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,316 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #98#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,316 INFO L272 TraceCheckUtils]: 71: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,317 INFO L290 TraceCheckUtils]: 72: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,317 INFO L290 TraceCheckUtils]: 73: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,318 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #100#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,318 INFO L272 TraceCheckUtils]: 76: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,320 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #102#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,320 INFO L272 TraceCheckUtils]: 81: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,321 INFO L290 TraceCheckUtils]: 83: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,321 INFO L290 TraceCheckUtils]: 84: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,322 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #104#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,322 INFO L290 TraceCheckUtils]: 86: Hoare triple {106677#(<= ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,322 INFO L290 TraceCheckUtils]: 87: Hoare triple {106677#(<= ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,322 INFO L290 TraceCheckUtils]: 88: Hoare triple {106677#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106750#(<= |main_#t~post7| 9)} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {106750#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 90: Hoare triple {106472#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; {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 91: Hoare triple {106472#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {106472#false} assume !(#t~post6 < 10);havoc #t~post6; {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L272 TraceCheckUtils]: 93: Hoare triple {106472#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 94: Hoare triple {106472#false} ~cond := #in~cond; {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 95: Hoare triple {106472#false} assume 0 == ~cond; {106472#false} is VALID [2022-04-28 05:54:16,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {106472#false} assume !false; {106472#false} is VALID [2022-04-28 05:54:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:54:16,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:16,713 INFO L290 TraceCheckUtils]: 96: Hoare triple {106472#false} assume !false; {106472#false} is VALID [2022-04-28 05:54:16,713 INFO L290 TraceCheckUtils]: 95: Hoare triple {106472#false} assume 0 == ~cond; {106472#false} is VALID [2022-04-28 05:54:16,713 INFO L290 TraceCheckUtils]: 94: Hoare triple {106472#false} ~cond := #in~cond; {106472#false} is VALID [2022-04-28 05:54:16,713 INFO L272 TraceCheckUtils]: 93: Hoare triple {106472#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {106472#false} is VALID [2022-04-28 05:54:16,714 INFO L290 TraceCheckUtils]: 92: Hoare triple {106472#false} assume !(#t~post6 < 10);havoc #t~post6; {106472#false} is VALID [2022-04-28 05:54:16,714 INFO L290 TraceCheckUtils]: 91: Hoare triple {106472#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106472#false} is VALID [2022-04-28 05:54:16,714 INFO L290 TraceCheckUtils]: 90: Hoare triple {106472#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; {106472#false} is VALID [2022-04-28 05:54:16,714 INFO L290 TraceCheckUtils]: 89: Hoare triple {106750#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {106472#false} is VALID [2022-04-28 05:54:16,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {106677#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106750#(<= |main_#t~post7| 9)} is VALID [2022-04-28 05:54:16,715 INFO L290 TraceCheckUtils]: 87: Hoare triple {106677#(<= ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,715 INFO L290 TraceCheckUtils]: 86: Hoare triple {106677#(<= ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,715 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #104#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,715 INFO L290 TraceCheckUtils]: 82: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,715 INFO L272 TraceCheckUtils]: 81: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,716 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #102#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,716 INFO L290 TraceCheckUtils]: 79: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,716 INFO L272 TraceCheckUtils]: 76: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,716 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #100#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,717 INFO L290 TraceCheckUtils]: 74: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L290 TraceCheckUtils]: 72: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L272 TraceCheckUtils]: 71: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #98#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L290 TraceCheckUtils]: 68: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L290 TraceCheckUtils]: 67: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,717 INFO L272 TraceCheckUtils]: 66: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {106677#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,719 INFO L290 TraceCheckUtils]: 64: Hoare triple {106667#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 05:54:16,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {106667#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:16,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {106667#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:16,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {106657#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 05:54:16,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {106657#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:16,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {106657#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:16,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {106644#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 05:54:16,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {106644#(<= ~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; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {106644#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {106644#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {106571#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 05:54:16,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {106571#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {106571#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,725 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #104#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,725 INFO L272 TraceCheckUtils]: 47: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,726 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #102#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,726 INFO L272 TraceCheckUtils]: 42: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,726 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #100#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L272 TraceCheckUtils]: 37: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #98#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,727 INFO L272 TraceCheckUtils]: 32: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {106571#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {106561#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 05:54:16,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {106561#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:16,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {106561#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:16,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {106551#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 05:54:16,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {106551#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:16,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {106551#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:16,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {106538#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 05:54:16,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(<= ~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; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {106538#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {106538#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {106528#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 05:54:16,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {106528#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:16,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {106528#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:16,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {106479#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 05:54:16,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {106479#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106471#true} {106479#(<= ~counter~0 0)} #96#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {106471#true} {106479#(<= ~counter~0 0)} #94#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 05:54:16,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 05:54:16,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 05:54:16,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {106471#true} is VALID [2022-04-28 05:54:16,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {106479#(<= ~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;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; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {106479#(<= ~counter~0 0)} call #t~ret9 := main(); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106479#(<= ~counter~0 0)} {106471#true} #108#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {106471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 05:54:16,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {106471#true} call ULTIMATE.init(); {106471#true} is VALID [2022-04-28 05:54:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 05:54:16,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777647389] [2022-04-28 05:54:16,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716846957] [2022-04-28 05:54:16,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716846957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:54:16,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:54:16,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 05:54:16,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159505285] [2022-04-28 05:54:16,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159505285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:16,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:16,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:54:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309189087] [2022-04-28 05:54:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 97 [2022-04-28 05:54:16,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:16,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:16,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:16,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:54:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:16,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:54:16,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:54:16,796 INFO L87 Difference]: Start difference. First operand 1054 states and 1402 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:20,003 INFO L93 Difference]: Finished difference Result 1535 states and 2087 transitions. [2022-04-28 05:54:20,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 05:54:20,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 97 [2022-04-28 05:54:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2022-04-28 05:54:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2022-04-28 05:54:20,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 261 transitions. [2022-04-28 05:54:20,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:20,233 INFO L225 Difference]: With dead ends: 1535 [2022-04-28 05:54:20,233 INFO L226 Difference]: Without dead ends: 1215 [2022-04-28 05:54:20,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:54:20,234 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 176 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:20,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 319 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:54:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2022-04-28 05:54:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1160. [2022-04-28 05:54:22,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:22,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1215 states. Second operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 05:54:22,387 INFO L74 IsIncluded]: Start isIncluded. First operand 1215 states. Second operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 05:54:22,388 INFO L87 Difference]: Start difference. First operand 1215 states. Second operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 05:54:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:22,430 INFO L93 Difference]: Finished difference Result 1215 states and 1591 transitions. [2022-04-28 05:54:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1591 transitions. [2022-04-28 05:54:22,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:22,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:22,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) Second operand 1215 states. [2022-04-28 05:54:22,434 INFO L87 Difference]: Start difference. First operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) Second operand 1215 states. [2022-04-28 05:54:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:22,477 INFO L93 Difference]: Finished difference Result 1215 states and 1591 transitions. [2022-04-28 05:54:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1591 transitions. [2022-04-28 05:54:22,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:22,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:22,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:22,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 05:54:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1536 transitions. [2022-04-28 05:54:22,536 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1536 transitions. Word has length 97 [2022-04-28 05:54:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:22,559 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1536 transitions. [2022-04-28 05:54:22,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:54:22,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1160 states and 1536 transitions. [2022-04-28 05:54:26,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1536 edges. 1536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1536 transitions. [2022-04-28 05:54:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 05:54:26,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:26,204 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 3, 3, 3, 3, 2, 2, 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] [2022-04-28 05:54:26,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 05:54:26,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 05:54:26,404 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1787026468, now seen corresponding path program 7 times [2022-04-28 05:54:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:26,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915924247] [2022-04-28 05:54:26,405 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1787026468, now seen corresponding path program 8 times [2022-04-28 05:54:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:26,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403009382] [2022-04-28 05:54:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:26,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:26,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427249899] [2022-04-28 05:54:26,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:54:26,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:26,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:26,418 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:54:26,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 05:54:26,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:54:26,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 05:54:26,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 05:54:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 05:54:26,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 05:54:26,576 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 05:54:26,576 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 05:54:26,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 05:54:26,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 05:54:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 05:54:26,782 INFO L356 BasicCegarLoop]: Path program histogram: [8, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 05:54:26,784 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 05:54:26,802 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-28 05:54:26,803 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 05:54:26,804 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 05:54:26,804 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 05:54:26,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 05:54:26 BoogieIcfgContainer [2022-04-28 05:54:26,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 05:54:26,805 INFO L158 Benchmark]: Toolchain (without parser) took 315960.50ms. Allocated memory was 204.5MB in the beginning and 425.7MB in the end (delta: 221.2MB). Free memory was 178.0MB in the beginning and 151.6MB in the end (delta: 26.4MB). Peak memory consumption was 247.0MB. Max. memory is 8.0GB. [2022-04-28 05:54:26,806 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 05:54:26,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.71ms. Allocated memory is still 204.5MB. Free memory was 177.8MB in the beginning and 176.5MB in the end (delta: 1.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-28 05:54:26,806 INFO L158 Benchmark]: Boogie Preprocessor took 23.99ms. Allocated memory is still 204.5MB. Free memory was 176.5MB in the beginning and 175.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 05:54:26,806 INFO L158 Benchmark]: RCFGBuilder took 254.72ms. Allocated memory is still 204.5MB. Free memory was 175.0MB in the beginning and 161.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 05:54:26,806 INFO L158 Benchmark]: TraceAbstraction took 315500.04ms. Allocated memory was 204.5MB in the beginning and 425.7MB in the end (delta: 221.2MB). Free memory was 161.3MB in the beginning and 151.6MB in the end (delta: 9.7MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. [2022-04-28 05:54:26,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.71ms. Allocated memory is still 204.5MB. Free memory was 177.8MB in the beginning and 176.5MB in the end (delta: 1.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.99ms. Allocated memory is still 204.5MB. Free memory was 176.5MB in the beginning and 175.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 254.72ms. Allocated memory is still 204.5MB. Free memory was 175.0MB in the beginning and 161.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 315500.04ms. Allocated memory was 204.5MB in the beginning and 425.7MB in the end (delta: 221.2MB). Free memory was 161.3MB in the beginning and 151.6MB in the end (delta: 9.7MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) [L8] COND FALSE !(!cond) [L24] RET assume_abort_if_not(x >= 1) [L25] CALL assume_abort_if_not(y >= 1) [L8] COND FALSE !(!cond) [L25] RET assume_abort_if_not(y >= 1) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b [L48] EXPR counter++ [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(a == y * r + x * p) [L50] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(b == x * q + y * s) [L51] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L51] RET __VERIFIER_assert(a == k * b + c) [L52] CALL __VERIFIER_assert(v == b * d) [L11] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(v == b * d) [L54] COND TRUE !(c >= 2 * v) [L59] c = c - v [L60] k = k + d [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b [L48] EXPR counter++ [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(a == y * r + x * p) [L50] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(b == x * q + y * s) [L51] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L51] RET __VERIFIER_assert(a == k * b + c) [L52] CALL __VERIFIER_assert(v == b * d) [L11] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(v == b * d) [L54] COND TRUE !(c >= 2 * v) [L59] c = c - v [L60] k = k + d [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND FALSE !(counter++<10) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) [L11] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 315.4s, OverallIterations: 35, TraceHistogramMax: 9, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 58.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2388 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2274 mSDsluCounter, 8586 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6658 mSDsCounter, 1191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6011 IncrementalHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1191 mSolverCounterUnsat, 1928 mSDtfsCounter, 6011 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3502 GetRequests, 3037 SyntacticMatches, 22 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=34, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 848 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 05:54:26,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...