/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:37:35,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:37:35,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:37:35,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:37:35,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:37:35,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:37:35,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:37:35,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:37:35,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:37:35,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:37:35,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:37:35,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:37:35,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:37:35,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:37:35,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:37:35,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:37:35,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:37:35,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:37:35,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:37:35,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:37:35,731 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:37:35,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:37:35,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:37:35,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:37:35,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:37:35,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:37:35,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:37:35,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:37:35,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:37:35,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:37:35,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:37:35,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:37:35,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:37:35,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:37:35,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:37:35,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:37:35,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:37:35,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:37:35,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:37:35,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:37:35,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:37:35,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:37:35,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:37:35,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:37:35,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:37:35,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:37:35,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:37:35,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:37:35,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:37:35,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:37:35,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:37:35,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:37:35,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:37:35,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:37:35,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:37:35,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:37:35,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:37:35,752 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:37:35,752 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:37:35,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:37:35,752 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:37:35,752 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 05:37:35,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:37:35,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:37:35,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:37:35,907 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:37:35,907 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:37:35,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-28 05:37:35,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2576e21/af7344f62a8548a0af48ddd0946ec4d5/FLAGcfb1e1477 [2022-04-28 05:37:36,253 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:37:36,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c [2022-04-28 05:37:36,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2576e21/af7344f62a8548a0af48ddd0946ec4d5/FLAGcfb1e1477 [2022-04-28 05:37:36,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2576e21/af7344f62a8548a0af48ddd0946ec4d5 [2022-04-28 05:37:36,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:37:36,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:37:36,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:37:36,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:37:36,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:37:36,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a65029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36, skipping insertion in model container [2022-04-28 05:37:36,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:37:36,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:37:36,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c[490,503] [2022-04-28 05:37:36,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:37:36,832 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:37:36,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound5.c[490,503] [2022-04-28 05:37:36,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:37:36,878 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:37:36,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36 WrapperNode [2022-04-28 05:37:36,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:37:36,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:37:36,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:37:36,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:37:36,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:37:36,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:37:36,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:37:36,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:37:36,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (1/1) ... [2022-04-28 05:37:36,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:37:36,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:36,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 05:37:36,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 05:37:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:37:36,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:37:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:37:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:37:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:37:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:37:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:37:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:37:36,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:37:37,059 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:37:37,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:37:37,220 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:37:37,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:37:37,227 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 05:37:37,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:37:37 BoogieIcfgContainer [2022-04-28 05:37:37,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:37:37,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:37:37,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:37:37,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:37:37,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:37:36" (1/3) ... [2022-04-28 05:37:37,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e03fd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:37:37, skipping insertion in model container [2022-04-28 05:37:37,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:37:36" (2/3) ... [2022-04-28 05:37:37,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e03fd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:37:37, skipping insertion in model container [2022-04-28 05:37:37,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:37:37" (3/3) ... [2022-04-28 05:37:37,234 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound5.c [2022-04-28 05:37:37,246 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:37:37,246 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:37:37,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:37:37,284 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@53208316, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67254acf [2022-04-28 05:37:37,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:37:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:37:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 05:37:37,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:37,296 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:37,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-28 05:37:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:37,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339146898] [2022-04-28 05:37:37,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-28 05:37:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:37,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557804569] [2022-04-28 05:37:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:37:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:37,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-28 05:37:37,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 05:37:37,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 05:37:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:37:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:37,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 05:37:37,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 05:37:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:37,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 05:37:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 05:37:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:37,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 05:37:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 05:37:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:37,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-28 05:37:37,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 05:37:37,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-28 05:37:37,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 05:37:37,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 05:37:37,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-28 05:37:37,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-28 05:37:37,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:37,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 05:37:37,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:37,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,516 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 05:37:37,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-28 05:37:37,517 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:37,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,518 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 05:37:37,518 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-28 05:37:37,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 05:37:37,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 05:37:37,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 05:37:37,520 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-28 05:37:37,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 05:37:37,521 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-28 05:37:37,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 05:37:37,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 05:37:37,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 05:37:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:37,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557804569] [2022-04-28 05:37:37,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557804569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:37,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:37,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:37:37,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339146898] [2022-04-28 05:37:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339146898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:37,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:37,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:37:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488534832] [2022-04-28 05:37:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 05:37:37,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:37,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:37,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:37,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:37:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:37:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:37:37,588 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:37,781 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-28 05:37:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:37:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 05:37:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-28 05:37:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-28 05:37:37,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-28 05:37:37,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:37,921 INFO L225 Difference]: With dead ends: 72 [2022-04-28 05:37:37,922 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 05:37:37,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:37:37,929 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:37,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 05:37:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 05:37:37,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:37,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:37,956 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:37,957 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:37,960 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 05:37:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:37:37,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:37,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:37,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-28 05:37:37,962 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-28 05:37:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:37,964 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 05:37:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:37:37,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:37,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:37,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:37,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-28 05:37:37,969 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-28 05:37:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:37,969 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-28 05:37:37,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:37,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-28 05:37:38,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 05:37:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 05:37:38,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:38,014 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:38,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:37:38,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-28 05:37:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:38,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026723286] [2022-04-28 05:37:38,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-28 05:37:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:38,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052657460] [2022-04-28 05:37:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:38,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:38,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137241969] [2022-04-28 05:37:38,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:38,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:38,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:38,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:38,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:37:38,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:37:38,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:38,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:37:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:38,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:38,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 05:37:38,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,256 INFO L272 TraceCheckUtils]: 11: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,258 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,258 INFO L272 TraceCheckUtils]: 17: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,260 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,262 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:38,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {435#(<= |main_#t~post6| 0)} is VALID [2022-04-28 05:37:38,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {349#false} is VALID [2022-04-28 05:37:38,263 INFO L272 TraceCheckUtils]: 29: Hoare triple {349#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {349#false} is VALID [2022-04-28 05:37:38,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-28 05:37:38,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-28 05:37:38,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 05:37:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:38,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:37:38,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:38,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052657460] [2022-04-28 05:37:38,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:38,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137241969] [2022-04-28 05:37:38,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137241969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:38,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:38,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:37:38,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:38,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026723286] [2022-04-28 05:37:38,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026723286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:38,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:38,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:37:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503970776] [2022-04-28 05:37:38,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:38,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 05:37:38,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:38,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:38,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:38,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:37:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:38,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:37:38,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:37:38,284 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:38,355 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-28 05:37:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:37:38,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 05:37:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 05:37:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 05:37:38,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-28 05:37:38,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:38,396 INFO L225 Difference]: With dead ends: 44 [2022-04-28 05:37:38,396 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 05:37:38,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:37:38,398 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:38,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 05:37:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 05:37:38,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:38,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:38,410 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:38,410 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:38,412 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 05:37:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 05:37:38,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:38,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:38,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-28 05:37:38,413 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-28 05:37:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:38,415 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 05:37:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 05:37:38,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:38,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:38,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:38,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-28 05:37:38,418 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-28 05:37:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:38,418 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-28 05:37:38,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:38,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-28 05:37:38,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-28 05:37:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 05:37:38,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:38,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:38,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:38,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:38,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-28 05:37:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:38,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929135944] [2022-04-28 05:37:38,682 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-28 05:37:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:38,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664903040] [2022-04-28 05:37:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:38,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:38,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221374470] [2022-04-28 05:37:38,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:38,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:38,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:38,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:37:38,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:38,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:38,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:37:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:38,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:38,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-28 05:37:38,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {682#true} is VALID [2022-04-28 05:37:38,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:38,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-28 05:37:38,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-28 05:37:38,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-28 05:37:38,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:38,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:38,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:38,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:38,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-28 05:37:38,896 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:38,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:37:38,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:38,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:38,898 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-28 05:37:38,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:38,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:38,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:38,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:38,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:38,901 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:38,901 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:38,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:38,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:38,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:38,902 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:38,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:38,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:38,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-28 05:37:38,903 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-28 05:37:38,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-28 05:37:38,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-28 05:37:38,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-28 05:37:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 05:37:38,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:37:39,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-28 05:37:39,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-28 05:37:39,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-28 05:37:39,117 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-28 05:37:39,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-28 05:37:39,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:39,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:39,127 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:39,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:39,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:39,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:39,127 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:39,127 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:39,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:39,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:39,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:39,130 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:39,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {738#(<= 1 main_~b~0)} is VALID [2022-04-28 05:37:39,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-28 05:37:39,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:39,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:39,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:37:39,133 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:39,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-28 05:37:39,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:39,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-28 05:37:39,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-28 05:37:39,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-28 05:37:39,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-28 05:37:39,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-28 05:37:39,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-28 05:37:39,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-28 05:37:39,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {682#true} is VALID [2022-04-28 05:37:39,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-28 05:37:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 05:37:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664903040] [2022-04-28 05:37:39,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221374470] [2022-04-28 05:37:39,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221374470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:37:39,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:37:39,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 05:37:39,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929135944] [2022-04-28 05:37:39,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929135944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:39,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:39,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:37:39,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439102538] [2022-04-28 05:37:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:39,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 05:37:39,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:39,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:39,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:39,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:37:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:37:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:37:39,156 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:39,387 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-28 05:37:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:37:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 05:37:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 05:37:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 05:37:39,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-28 05:37:39,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:39,443 INFO L225 Difference]: With dead ends: 53 [2022-04-28 05:37:39,443 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 05:37:39,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:37:39,451 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:39,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:37:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 05:37:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-28 05:37:39,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:39,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:39,484 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:39,484 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:39,490 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-28 05:37:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 05:37:39,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:39,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:39,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 05:37:39,494 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-28 05:37:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:39,498 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-28 05:37:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-28 05:37:39,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:39,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:39,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 05:37:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-28 05:37:39,501 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-28 05:37:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:39,502 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-28 05:37:39,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:39,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-28 05:37:39,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 05:37:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 05:37:39,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:39,547 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:39,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 05:37:39,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 05:37:39,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-28 05:37:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:39,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928765416] [2022-04-28 05:37:39,760 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-28 05:37:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:39,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735012391] [2022-04-28 05:37:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:39,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:39,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:39,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2041943200] [2022-04-28 05:37:39,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:39,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:39,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:39,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:39,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:37:39,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:37:39,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:39,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 05:37:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:39,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:39,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1166#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {1166#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:39,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L272 TraceCheckUtils]: 11: Hoare triple {1166#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {1166#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L272 TraceCheckUtils]: 17: Hoare triple {1166#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:39,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L272 TraceCheckUtils]: 22: Hoare triple {1166#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-28 05:37:39,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 5);havoc #t~post6; {1166#true} is VALID [2022-04-28 05:37:39,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {1166#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:37:39,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:37:39,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !!(#t~post7 < 5);havoc #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:37:39,948 INFO L272 TraceCheckUtils]: 32: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:39,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:39,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-28 05:37:39,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-28 05:37:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:39,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:37:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:39,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735012391] [2022-04-28 05:37:39,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:39,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041943200] [2022-04-28 05:37:39,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041943200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:39,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:39,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:39,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:39,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928765416] [2022-04-28 05:37:39,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928765416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:39,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:39,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679378931] [2022-04-28 05:37:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-28 05:37:39,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:39,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:39,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:39,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:37:39,968 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:40,147 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-28 05:37:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-28 05:37:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 05:37:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 05:37:40,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 05:37:40,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:40,201 INFO L225 Difference]: With dead ends: 51 [2022-04-28 05:37:40,201 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 05:37:40,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:37:40,202 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:40,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 05:37:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-28 05:37:40,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:40,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:40,233 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:40,234 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:40,235 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 05:37:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 05:37:40,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:40,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:40,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-28 05:37:40,237 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-28 05:37:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:40,238 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-28 05:37:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-28 05:37:40,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:40,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:40,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:40,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-28 05:37:40,240 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-28 05:37:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:40,241 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-28 05:37:40,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 05:37:40,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-28 05:37:40,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-28 05:37:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 05:37:40,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:40,286 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:40,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:37:40,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:40,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-28 05:37:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971206976] [2022-04-28 05:37:40,499 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-28 05:37:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470168741] [2022-04-28 05:37:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:40,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:40,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184524657] [2022-04-28 05:37:40,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:40,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:40,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:40,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:40,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 05:37:40,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:40,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:40,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:37:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:40,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:40,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-28 05:37:40,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,748 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #78#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,761 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #80#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {1576#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,762 INFO L272 TraceCheckUtils]: 17: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,763 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #82#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,763 INFO L272 TraceCheckUtils]: 22: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,765 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #84#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-28 05:37:40,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-28 05:37:40,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {1655#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-28 05:37:40,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {1655#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1655#(<= ~counter~0 1)} is VALID [2022-04-28 05:37:40,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {1655#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1665#(<= |main_#t~post7| 1)} is VALID [2022-04-28 05:37:40,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {1665#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1569#false} is VALID [2022-04-28 05:37:40,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {1569#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 5);havoc #t~post6; {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {1569#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-28 05:37:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:40,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:37:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:40,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470168741] [2022-04-28 05:37:40,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184524657] [2022-04-28 05:37:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184524657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:40,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:40,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:40,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971206976] [2022-04-28 05:37:40,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971206976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:40,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:40,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530853117] [2022-04-28 05:37:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 05:37:40,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:40,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:40,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:40,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:40,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:37:40,784 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:40,916 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-28 05:37:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 05:37:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 05:37:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-28 05:37:40,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-28 05:37:40,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:40,989 INFO L225 Difference]: With dead ends: 72 [2022-04-28 05:37:40,989 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 05:37:40,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:37:40,990 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:40,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 05:37:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 05:37:41,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:41,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:41,023 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:41,023 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:41,025 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 05:37:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 05:37:41,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:41,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:41,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-28 05:37:41,025 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-28 05:37:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:41,027 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-28 05:37:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 05:37:41,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:41,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:41,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:41,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 05:37:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-28 05:37:41,029 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-28 05:37:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:41,029 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-28 05:37:41,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 05:37:41,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-28 05:37:41,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-28 05:37:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:37:41,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:41,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:41,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 05:37:41,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:41,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-28 05:37:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:41,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362362643] [2022-04-28 05:37:41,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-28 05:37:41,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:41,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713339178] [2022-04-28 05:37:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:41,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618407249] [2022-04-28 05:37:41,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:41,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:41,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:41,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 05:37:41,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:41,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:41,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:37:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:41,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:41,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-28 05:37:41,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2017#true} is VALID [2022-04-28 05:37:41,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-28 05:37:41,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:37:41,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:41,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:41,563 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} {2017#true} #80#return; {2069#(<= 1 main_~y~0)} is VALID [2022-04-28 05:37:41,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,563 INFO L272 TraceCheckUtils]: 17: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,564 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,564 INFO L272 TraceCheckUtils]: 22: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,566 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,569 INFO L272 TraceCheckUtils]: 32: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,570 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:37:41,571 INFO L272 TraceCheckUtils]: 37: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:41,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:41,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-28 05:37:41,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-28 05:37:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 05:37:41,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:37:41,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-28 05:37:41,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-28 05:37:41,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:41,752 INFO L272 TraceCheckUtils]: 37: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:41,753 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,753 INFO L272 TraceCheckUtils]: 32: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,755 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,756 INFO L272 TraceCheckUtils]: 22: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,756 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,757 INFO L272 TraceCheckUtils]: 17: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:37:41,757 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-28 05:37:41,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-28 05:37:41,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-28 05:37:41,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2017#true} is VALID [2022-04-28 05:37:41,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-28 05:37:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 05:37:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713339178] [2022-04-28 05:37:41,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618407249] [2022-04-28 05:37:41,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618407249] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:37:41,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:37:41,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 05:37:41,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:41,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [362362643] [2022-04-28 05:37:41,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [362362643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:41,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:41,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45087541] [2022-04-28 05:37:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-28 05:37:41,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:41,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:41,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:41,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:41,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:37:41,782 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:41,966 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-28 05:37:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-28 05:37:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:41,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 05:37:42,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:42,012 INFO L225 Difference]: With dead ends: 61 [2022-04-28 05:37:42,012 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 05:37:42,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:37:42,013 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:42,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 05:37:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-28 05:37:42,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:42,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:42,063 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:42,064 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:42,068 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-28 05:37:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 05:37:42,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:42,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:42,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 59 states. [2022-04-28 05:37:42,069 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 59 states. [2022-04-28 05:37:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:42,072 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-28 05:37:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 05:37:42,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:42,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:42,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:42,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-28 05:37:42,075 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-28 05:37:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:42,075 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-28 05:37:42,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:37:42,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-28 05:37:42,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 05:37:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 05:37:42,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:42,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:42,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 05:37:42,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:42,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-28 05:37:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:42,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [525798746] [2022-04-28 05:37:42,362 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-28 05:37:42,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:42,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621780184] [2022-04-28 05:37:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:42,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:42,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [473525269] [2022-04-28 05:37:42,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:42,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:42,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:42,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:37:42,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:42,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:42,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:37:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:42,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:42,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-28 05:37:42,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2629#true} is VALID [2022-04-28 05:37:42,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-28 05:37:42,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-28 05:37:42,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2629#true} is VALID [2022-04-28 05:37:42,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:37:42,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:42,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:37:42,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} {2629#true} #78#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-28 05:37:42,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {2666#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2666#(<= 1 main_~x~0)} #80#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-28 05:37:42,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {2666#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,680 INFO L272 TraceCheckUtils]: 17: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,683 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,683 INFO L272 TraceCheckUtils]: 22: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,683 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,689 INFO L272 TraceCheckUtils]: 32: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,690 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,690 INFO L272 TraceCheckUtils]: 37: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,691 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:37:42,691 INFO L272 TraceCheckUtils]: 42: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:42,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:42,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-28 05:37:42,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-28 05:37:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 05:37:42,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:37:42,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-28 05:37:42,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-28 05:37:42,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:42,865 INFO L272 TraceCheckUtils]: 42: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:42,866 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,866 INFO L272 TraceCheckUtils]: 37: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,866 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,867 INFO L272 TraceCheckUtils]: 32: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,869 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,869 INFO L272 TraceCheckUtils]: 22: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,873 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,873 INFO L272 TraceCheckUtils]: 17: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:37:42,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L272 TraceCheckUtils]: 11: Hoare triple {2629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-28 05:37:42,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-28 05:37:42,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-28 05:37:42,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2629#true} is VALID [2022-04-28 05:37:42,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-28 05:37:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 05:37:42,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:37:42,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621780184] [2022-04-28 05:37:42,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:37:42,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473525269] [2022-04-28 05:37:42,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473525269] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:37:42,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:37:42,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 05:37:42,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:37:42,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [525798746] [2022-04-28 05:37:42,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [525798746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:37:42,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:37:42,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:37:42,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635681068] [2022-04-28 05:37:42,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:37:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-28 05:37:42,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:37:42,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:42,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:42,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:37:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:37:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:37:42,904 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:43,118 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-28 05:37:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:37:43,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-28 05:37:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:37:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 05:37:43,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 05:37:43,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:43,169 INFO L225 Difference]: With dead ends: 65 [2022-04-28 05:37:43,169 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 05:37:43,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:37:43,170 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:37:43,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:37:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 05:37:43,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 05:37:43,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:37:43,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:43,226 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:43,226 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:43,228 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 05:37:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-28 05:37:43,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:43,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:43,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 05:37:43,229 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-28 05:37:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:37:43,230 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-28 05:37:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-28 05:37:43,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:37:43,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:37:43,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:37:43,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:37:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:37:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-28 05:37:43,233 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-28 05:37:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:37:43,233 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-28 05:37:43,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:37:43,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-28 05:37:43,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:37:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-28 05:37:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:37:43,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:37:43,307 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:37:43,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 05:37:43,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:43,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:37:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:37:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-28 05:37:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:37:43,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50532104] [2022-04-28 05:37:43,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:37:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-28 05:37:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:37:43,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008547960] [2022-04-28 05:37:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:37:43,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:37:43,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:37:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [897261439] [2022-04-28 05:37:43,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:37:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:37:43,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:37:43,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:37:43,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:37:43,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:37:43,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:37:43,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:37:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:37:43,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:37:46,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-28 05:37:46,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {3295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3295#true} is VALID [2022-04-28 05:37:46,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:46,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-28 05:37:46,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3295#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {3295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {3295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:46,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-28 05:37:46,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,969 INFO L272 TraceCheckUtils]: 17: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:46,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:46,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:46,970 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #82#return; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,970 INFO L272 TraceCheckUtils]: 22: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:46,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:46,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:46,971 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #84#return; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,973 INFO L272 TraceCheckUtils]: 32: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-28 05:37:46,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-28 05:37:46,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-28 05:37:46,975 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #86#return; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,976 INFO L272 TraceCheckUtils]: 37: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:46,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:46,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:46,977 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #88#return; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,977 INFO L272 TraceCheckUtils]: 42: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3295#true} is VALID [2022-04-28 05:37:46,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:46,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:46,978 INFO L290 TraceCheckUtils]: 45: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:37:46,979 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #90#return; {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:37:46,980 INFO L272 TraceCheckUtils]: 47: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:37:46,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:37:46,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-28 05:37:46,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-28 05:37:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 05:37:46,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:26,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008547960] [2022-04-28 05:38:26,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:26,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897261439] [2022-04-28 05:38:26,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897261439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:38:26,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:38:26,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 05:38:26,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:26,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50532104] [2022-04-28 05:38:26,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50532104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:26,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:26,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:38:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369954174] [2022-04-28 05:38:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-28 05:38:26,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:26,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:26,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:26,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:38:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:38:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:26,355 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:26,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:26,708 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 05:38:26,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:38:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-28 05:38:26,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 05:38:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 05:38:26,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 05:38:26,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:26,760 INFO L225 Difference]: With dead ends: 69 [2022-04-28 05:38:26,760 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 05:38:26,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:38:26,761 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:26,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 160 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:38:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 05:38:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-28 05:38:26,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:26,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:26,810 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:26,811 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:26,813 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 05:38:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 05:38:26,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:26,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:26,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 05:38:26,821 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 05:38:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:26,823 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 05:38:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 05:38:26,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:26,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:26,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:26,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:38:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-28 05:38:26,825 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-28 05:38:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:26,825 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-28 05:38:26,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:38:26,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-28 05:38:26,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-28 05:38:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 05:38:26,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:26,925 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:26,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:27,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:27,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-28 05:38:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305859394] [2022-04-28 05:38:27,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-28 05:38:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391415587] [2022-04-28 05:38:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:27,181 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:27,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037413464] [2022-04-28 05:38:27,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:27,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:27,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:27,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 05:38:27,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:27,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:27,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:38:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:27,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:27,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-28 05:38:27,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3879#true} is VALID [2022-04-28 05:38:27,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,428 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-28 05:38:27,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 5);havoc #t~post6; {3879#true} is VALID [2022-04-28 05:38:27,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,431 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,432 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,432 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,433 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,433 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,434 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,434 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:27,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:27,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:27,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:27,435 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:27,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-28 05:38:27,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-28 05:38:27,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-28 05:38:27,440 INFO L272 TraceCheckUtils]: 55: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:27,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:27,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-28 05:38:27,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-28 05:38:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:27,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:43,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-28 05:38:43,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-28 05:38:43,110 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:43,111 INFO L272 TraceCheckUtils]: 55: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:43,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:38:43,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:38:43,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:38:43,113 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,114 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,114 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,115 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,115 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,116 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,116 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,116 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:38:43,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 5);havoc #t~post6; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3879#true} is VALID [2022-04-28 05:38:43,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-28 05:38:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:43,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391415587] [2022-04-28 05:38:43,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:43,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037413464] [2022-04-28 05:38:43,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037413464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:43,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:43,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 05:38:43,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:43,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305859394] [2022-04-28 05:38:43,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305859394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:43,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:43,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:38:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835570841] [2022-04-28 05:38:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2022-04-28 05:38:43,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:43,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:38:43,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:38:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:38:43,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:38:43,151 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:38:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:43,530 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-28 05:38:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:38:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2022-04-28 05:38:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:38:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 05:38:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:38:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-28 05:38:43,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-28 05:38:43,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:43,610 INFO L225 Difference]: With dead ends: 96 [2022-04-28 05:38:43,611 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 05:38:43,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:38:43,611 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:43,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:38:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 05:38:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-28 05:38:43,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:43,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:43,673 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:43,674 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:43,676 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 05:38:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-28 05:38:43,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:43,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:43,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 94 states. [2022-04-28 05:38:43,677 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 94 states. [2022-04-28 05:38:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:43,679 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 05:38:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-28 05:38:43,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:43,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:43,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:43,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-28 05:38:43,682 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-28 05:38:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:43,682 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-28 05:38:43,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:38:43,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-28 05:38:43,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-28 05:38:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 05:38:43,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:43,800 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:43,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:44,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 05:38:44,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-28 05:38:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:44,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634873053] [2022-04-28 05:38:44,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-28 05:38:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:44,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441867815] [2022-04-28 05:38:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:44,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877412616] [2022-04-28 05:38:44,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:44,012 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:44,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 05:38:44,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:44,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:44,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:38:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:44,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:44,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-28 05:38:44,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #78#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,325 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #80#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,325 INFO L272 TraceCheckUtils]: 17: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,327 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #82#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,327 INFO L272 TraceCheckUtils]: 22: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,329 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #84#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:44,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {4797#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:44,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {4876#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:44,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {4876#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4876#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:44,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {4876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,331 INFO L272 TraceCheckUtils]: 32: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,332 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #86#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,333 INFO L272 TraceCheckUtils]: 37: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,334 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #88#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,335 INFO L272 TraceCheckUtils]: 42: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,336 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #90#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,337 INFO L272 TraceCheckUtils]: 47: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,340 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #92#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4959#(<= |main_#t~post6| 2)} is VALID [2022-04-28 05:38:44,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {4959#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {4790#false} is VALID [2022-04-28 05:38:44,341 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-28 05:38:44,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-28 05:38:44,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-28 05:38:44,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-28 05:38:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:44,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:44,601 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-28 05:38:44,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-28 05:38:44,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-28 05:38:44,601 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-28 05:38:44,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {4790#false} is VALID [2022-04-28 05:38:44,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {4991#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(< |main_#t~post6| 5)} is VALID [2022-04-28 05:38:44,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {4991#(< ~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; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,603 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #92#return; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,603 INFO L272 TraceCheckUtils]: 47: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,604 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #90#return; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,605 INFO L272 TraceCheckUtils]: 42: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,605 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #88#return; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,606 INFO L272 TraceCheckUtils]: 37: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,606 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 5)} #86#return; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,609 INFO L272 TraceCheckUtils]: 32: Hoare triple {4991#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {4991#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {5064#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4991#(< ~counter~0 5)} is VALID [2022-04-28 05:38:44,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {5064#(< ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5064#(< ~counter~0 4)} is VALID [2022-04-28 05:38:44,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {5064#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {5064#(< ~counter~0 4)} is VALID [2022-04-28 05:38:44,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {4886#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5064#(< ~counter~0 4)} is VALID [2022-04-28 05:38:44,611 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #84#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,612 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #82#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,612 INFO L272 TraceCheckUtils]: 17: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {4886#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,612 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #80#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L272 TraceCheckUtils]: 11: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {4886#(<= ~counter~0 2)} #78#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-28 05:38:44,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {4886#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-28 05:38:44,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {4886#(<= ~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;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {4886#(<= ~counter~0 2)} call #t~ret8 := main(); {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4886#(<= ~counter~0 2)} {4789#true} #98#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4886#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:44,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-28 05:38:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:44,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:44,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441867815] [2022-04-28 05:38:44,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:44,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877412616] [2022-04-28 05:38:44,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877412616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:44,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:44,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 05:38:44,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:44,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634873053] [2022-04-28 05:38:44,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634873053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:44,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:44,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:38:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541278982] [2022-04-28 05:38:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-28 05:38:44,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:44,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:44,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:38:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:38:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:44,649 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:44,836 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-28 05:38:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:38:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-28 05:38:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 05:38:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 05:38:44,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 05:38:44,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:44,874 INFO L225 Difference]: With dead ends: 111 [2022-04-28 05:38:44,874 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 05:38:44,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:38:44,875 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:44,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:38:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 05:38:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 05:38:44,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:44,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:44,957 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:44,957 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:44,959 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 05:38:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 05:38:44,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:44,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:44,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-28 05:38:44,960 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-28 05:38:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:44,962 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-28 05:38:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 05:38:44,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:44,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:44,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:44,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 05:38:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-28 05:38:44,964 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-28 05:38:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:44,964 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-28 05:38:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:44,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-28 05:38:45,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-28 05:38:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 05:38:45,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:45,067 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:45,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 05:38:45,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 05:38:45,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-28 05:38:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66769835] [2022-04-28 05:38:45,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-28 05:38:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801285633] [2022-04-28 05:38:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:45,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:45,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870894704] [2022-04-28 05:38:45,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:45,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:45,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:45,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:45,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 05:38:45,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:45,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:45,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:38:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:45,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:45,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #98#return; {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret8 := main(); {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {5793#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {5793#true} ~cond := #in~cond; {5819#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:38:45,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {5819#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:45,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:45,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} {5793#true} #78#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:45,512 INFO L272 TraceCheckUtils]: 11: Hoare triple {5830#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,513 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5793#true} {5830#(<= 1 main_~x~0)} #80#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:45,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {5830#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,513 INFO L272 TraceCheckUtils]: 17: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,523 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #82#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,523 INFO L272 TraceCheckUtils]: 22: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,524 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #84#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {5849#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {5889#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {5889#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,525 INFO L272 TraceCheckUtils]: 32: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,525 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #86#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,525 INFO L272 TraceCheckUtils]: 37: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,526 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #88#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,526 INFO L272 TraceCheckUtils]: 42: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,526 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #90#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,527 INFO L272 TraceCheckUtils]: 47: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,527 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #92#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {5889#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {5889#(<= 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; {5962#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:45,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {5962#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:45,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {5962#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:45,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {5962#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5794#false} is VALID [2022-04-28 05:38:45,528 INFO L272 TraceCheckUtils]: 57: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5794#false} is VALID [2022-04-28 05:38:45,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-28 05:38:45,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-28 05:38:45,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-28 05:38:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:38:45,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:45,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {5794#false} assume !false; {5794#false} is VALID [2022-04-28 05:38:45,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {5794#false} assume 0 == ~cond; {5794#false} is VALID [2022-04-28 05:38:45,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {5794#false} ~cond := #in~cond; {5794#false} is VALID [2022-04-28 05:38:45,699 INFO L272 TraceCheckUtils]: 57: Hoare triple {5794#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5794#false} is VALID [2022-04-28 05:38:45,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {5962#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5794#false} is VALID [2022-04-28 05:38:45,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {5962#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:45,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {5962#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5962#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:45,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {5889#(<= 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; {5962#(<= 1 main_~b~0)} is VALID [2022-04-28 05:38:45,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {5889#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,700 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #92#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,701 INFO L290 TraceCheckUtils]: 48: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,701 INFO L272 TraceCheckUtils]: 47: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,701 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #90#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,701 INFO L272 TraceCheckUtils]: 42: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #88#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L272 TraceCheckUtils]: 37: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5793#true} {5889#(<= 1 main_~c~0)} #86#return; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,702 INFO L272 TraceCheckUtils]: 32: Hoare triple {5889#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {5889#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {5889#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5889#(<= 1 main_~c~0)} is VALID [2022-04-28 05:38:45,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {5849#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {5849#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,704 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #84#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,704 INFO L272 TraceCheckUtils]: 22: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,704 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5793#true} {5849#(<= 1 main_~a~0)} #82#return; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,705 INFO L272 TraceCheckUtils]: 17: Hoare triple {5849#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {5830#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {5849#(<= 1 main_~a~0)} is VALID [2022-04-28 05:38:45,708 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5793#true} {5830#(<= 1 main_~x~0)} #80#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:45,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {5793#true} assume !(0 == ~cond); {5793#true} is VALID [2022-04-28 05:38:45,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {5793#true} ~cond := #in~cond; {5793#true} is VALID [2022-04-28 05:38:45,708 INFO L272 TraceCheckUtils]: 11: Hoare triple {5830#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} {5793#true} #78#return; {5830#(<= 1 main_~x~0)} is VALID [2022-04-28 05:38:45,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {5823#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:45,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {6143#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5823#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:38:45,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {5793#true} ~cond := #in~cond; {6143#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:38:45,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {5793#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {5793#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {5793#true} call #t~ret8 := main(); {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5793#true} {5793#true} #98#return; {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#true} assume true; {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {5793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {5793#true} call ULTIMATE.init(); {5793#true} is VALID [2022-04-28 05:38:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 05:38:45,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:45,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801285633] [2022-04-28 05:38:45,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:45,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870894704] [2022-04-28 05:38:45,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870894704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:45,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:45,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:38:45,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66769835] [2022-04-28 05:38:45,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66769835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:45,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:45,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:38:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111865596] [2022-04-28 05:38:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-28 05:38:45,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:45,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:45,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:38:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:38:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:45,731 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:46,523 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-28 05:38:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:38:46,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-28 05:38:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 05:38:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-28 05:38:46,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-28 05:38:46,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:46,639 INFO L225 Difference]: With dead ends: 182 [2022-04-28 05:38:46,639 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 05:38:46,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:38:46,640 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:46,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 317 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:38:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 05:38:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-28 05:38:46,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:46,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,846 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,846 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:46,850 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-28 05:38:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-28 05:38:46,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:46,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:46,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-28 05:38:46,852 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-28 05:38:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:46,856 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-28 05:38:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-28 05:38:46,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:46,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:46,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:46,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-28 05:38:46,861 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-28 05:38:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:46,861 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-28 05:38:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 05:38:46,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-28 05:38:47,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-28 05:38:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 05:38:47,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:47,078 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:47,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 05:38:47,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 05:38:47,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-28 05:38:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:47,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466817043] [2022-04-28 05:38:47,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-28 05:38:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:47,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555097488] [2022-04-28 05:38:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:47,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:47,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145845756] [2022-04-28 05:38:47,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:47,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:47,300 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:47,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 05:38:47,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:47,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:47,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:38:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:47,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:47,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {7185#true} call ULTIMATE.init(); {7185#true} is VALID [2022-04-28 05:38:47,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {7185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7193#(<= ~counter~0 0)} {7185#true} #98#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {7193#(<= ~counter~0 0)} call #t~ret8 := main(); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {7193#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #78#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,612 INFO L272 TraceCheckUtils]: 11: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,613 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #80#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {7193#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,614 INFO L272 TraceCheckUtils]: 17: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,615 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #82#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,616 INFO L272 TraceCheckUtils]: 22: Hoare triple {7193#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {7193#(<= ~counter~0 0)} ~cond := #in~cond; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {7193#(<= ~counter~0 0)} assume !(0 == ~cond); {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {7193#(<= ~counter~0 0)} assume true; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,617 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7193#(<= ~counter~0 0)} {7193#(<= ~counter~0 0)} #84#return; {7193#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:47,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {7193#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7272#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:47,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {7272#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {7272#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:47,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {7272#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7272#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:47,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {7272#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {7282#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,620 INFO L272 TraceCheckUtils]: 32: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,621 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #86#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,622 INFO L272 TraceCheckUtils]: 37: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,624 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #88#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,624 INFO L272 TraceCheckUtils]: 42: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,625 INFO L290 TraceCheckUtils]: 44: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,625 INFO L290 TraceCheckUtils]: 45: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,626 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #90#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,627 INFO L272 TraceCheckUtils]: 47: Hoare triple {7282#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {7282#(<= ~counter~0 2)} ~cond := #in~cond; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {7282#(<= ~counter~0 2)} assume !(0 == ~cond); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,628 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7282#(<= ~counter~0 2)} {7282#(<= ~counter~0 2)} #92#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {7282#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {7282#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7352#(<= |main_#t~post7| 2)} is VALID [2022-04-28 05:38:47,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {7352#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {7186#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; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {7186#false} assume !(#t~post6 < 5);havoc #t~post6; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L272 TraceCheckUtils]: 58: Hoare triple {7186#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L290 TraceCheckUtils]: 59: Hoare triple {7186#false} ~cond := #in~cond; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {7186#false} assume 0 == ~cond; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-04-28 05:38:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:47,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {7186#false} assume !false; {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {7186#false} assume 0 == ~cond; {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {7186#false} ~cond := #in~cond; {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L272 TraceCheckUtils]: 58: Hoare triple {7186#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {7186#false} assume !(#t~post6 < 5);havoc #t~post6; {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 56: Hoare triple {7186#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {7186#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; {7186#false} is VALID [2022-04-28 05:38:47,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {7186#false} is VALID [2022-04-28 05:38:47,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {7402#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7398#(< |main_#t~post7| 5)} is VALID [2022-04-28 05:38:47,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {7402#(< ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,902 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #92#return; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,902 INFO L290 TraceCheckUtils]: 48: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,902 INFO L272 TraceCheckUtils]: 47: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,903 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #90#return; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,903 INFO L272 TraceCheckUtils]: 42: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,904 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #88#return; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,904 INFO L272 TraceCheckUtils]: 37: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,905 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7185#true} {7402#(< ~counter~0 5)} #86#return; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,905 INFO L272 TraceCheckUtils]: 32: Hoare triple {7402#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {7402#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {7472#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7402#(< ~counter~0 5)} is VALID [2022-04-28 05:38:47,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {7472#(< ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7472#(< ~counter~0 4)} is VALID [2022-04-28 05:38:47,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {7472#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {7472#(< ~counter~0 4)} is VALID [2022-04-28 05:38:47,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {7282#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7472#(< ~counter~0 4)} is VALID [2022-04-28 05:38:47,907 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #84#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,908 INFO L272 TraceCheckUtils]: 22: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,908 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #82#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,909 INFO L272 TraceCheckUtils]: 17: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {7282#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #80#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7185#true} {7282#(<= ~counter~0 2)} #78#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {7185#true} assume true; {7185#true} is VALID [2022-04-28 05:38:47,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {7185#true} assume !(0 == ~cond); {7185#true} is VALID [2022-04-28 05:38:47,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {7185#true} ~cond := #in~cond; {7185#true} is VALID [2022-04-28 05:38:47,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {7282#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7185#true} is VALID [2022-04-28 05:38:47,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {7282#(<= ~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;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {7282#(<= ~counter~0 2)} call #t~ret8 := main(); {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7282#(<= ~counter~0 2)} {7185#true} #98#return; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {7282#(<= ~counter~0 2)} assume true; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {7185#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {7282#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:47,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {7185#true} call ULTIMATE.init(); {7185#true} is VALID [2022-04-28 05:38:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:47,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555097488] [2022-04-28 05:38:47,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:47,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145845756] [2022-04-28 05:38:47,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145845756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:47,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:47,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 05:38:47,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:47,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466817043] [2022-04-28 05:38:47,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466817043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:47,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:47,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:38:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397116772] [2022-04-28 05:38:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:47,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 05:38:47,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:47,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:47,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:47,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:38:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:38:47,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:47,950 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,289 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-28 05:38:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:38:48,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 05:38:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-28 05:38:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-28 05:38:48,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-28 05:38:48,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:48,352 INFO L225 Difference]: With dead ends: 183 [2022-04-28 05:38:48,352 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 05:38:48,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:38:48,355 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:48,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:38:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 05:38:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 05:38:48,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:48,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:48,535 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:48,535 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,538 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-28 05:38:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 05:38:48,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:48,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:48,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-28 05:38:48,539 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-28 05:38:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:48,542 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-28 05:38:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 05:38:48,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:48,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:48,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:48,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 05:38:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-28 05:38:48,546 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-28 05:38:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:48,546 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-28 05:38:48,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:48,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-28 05:38:48,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-28 05:38:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 05:38:48,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:48,765 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:48,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:48,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 05:38:48,965 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-28 05:38:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843285837] [2022-04-28 05:38:48,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-28 05:38:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843423994] [2022-04-28 05:38:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:48,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025879627] [2022-04-28 05:38:48,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:48,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:48,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:48,984 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:48,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 05:38:49,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:49,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:49,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:38:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:49,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:49,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-28 05:38:49,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8525#(<= ~counter~0 0)} {8517#true} #98#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {8525#(<= ~counter~0 0)} call #t~ret8 := main(); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {8525#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,320 INFO L272 TraceCheckUtils]: 6: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #78#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,323 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #80#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {8525#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,324 INFO L272 TraceCheckUtils]: 17: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,325 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #82#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,325 INFO L272 TraceCheckUtils]: 22: Hoare triple {8525#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {8525#(<= ~counter~0 0)} ~cond := #in~cond; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {8525#(<= ~counter~0 0)} assume !(0 == ~cond); {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {8525#(<= ~counter~0 0)} assume true; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,327 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8525#(<= ~counter~0 0)} {8525#(<= ~counter~0 0)} #84#return; {8525#(<= ~counter~0 0)} is VALID [2022-04-28 05:38:49,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {8525#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {8604#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {8604#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {8604#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {8614#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,329 INFO L272 TraceCheckUtils]: 32: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,330 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #86#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,331 INFO L272 TraceCheckUtils]: 37: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,333 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #88#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,333 INFO L272 TraceCheckUtils]: 42: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,335 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #90#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,336 INFO L272 TraceCheckUtils]: 47: Hoare triple {8614#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {8614#(<= ~counter~0 2)} ~cond := #in~cond; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {8614#(<= ~counter~0 2)} assume !(0 == ~cond); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {8614#(<= ~counter~0 2)} assume true; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,337 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8614#(<= ~counter~0 2)} {8614#(<= ~counter~0 2)} #92#return; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {8614#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {8614#(<= ~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; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {8614#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {8687#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {8687#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {8687#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8697#(<= |main_#t~post7| 3)} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {8697#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {8518#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; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {8518#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {8518#false} assume !(#t~post6 < 5);havoc #t~post6; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L272 TraceCheckUtils]: 62: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L290 TraceCheckUtils]: 65: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-28 05:38:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:49,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:38:49,603 INFO L290 TraceCheckUtils]: 65: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L272 TraceCheckUtils]: 62: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {8518#false} assume !(#t~post6 < 5);havoc #t~post6; {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {8518#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {8518#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; {8518#false} is VALID [2022-04-28 05:38:49,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {8743#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {8518#false} is VALID [2022-04-28 05:38:49,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {8747#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8743#(< |main_#t~post7| 5)} is VALID [2022-04-28 05:38:49,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {8747#(< ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8747#(< ~counter~0 5)} is VALID [2022-04-28 05:38:49,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {8747#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {8747#(< ~counter~0 5)} is VALID [2022-04-28 05:38:49,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {8687#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8747#(< ~counter~0 5)} is VALID [2022-04-28 05:38:49,606 INFO L290 TraceCheckUtils]: 53: Hoare triple {8687#(<= ~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; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {8687#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,607 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #92#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,607 INFO L272 TraceCheckUtils]: 47: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,608 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #90#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,608 INFO L290 TraceCheckUtils]: 44: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,608 INFO L272 TraceCheckUtils]: 42: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,609 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #88#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,609 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,609 INFO L272 TraceCheckUtils]: 37: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,610 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8517#true} {8687#(<= ~counter~0 3)} #86#return; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,610 INFO L272 TraceCheckUtils]: 32: Hoare triple {8687#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {8687#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {8614#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8687#(<= ~counter~0 3)} is VALID [2022-04-28 05:38:49,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {8614#(<= ~counter~0 2)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {8614#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8614#(<= ~counter~0 2)} is VALID [2022-04-28 05:38:49,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #84#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,612 INFO L272 TraceCheckUtils]: 22: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,613 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #82#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {8604#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,614 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #80#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,614 INFO L272 TraceCheckUtils]: 11: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8604#(<= ~counter~0 1)} #78#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-28 05:38:49,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-28 05:38:49,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-28 05:38:49,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {8604#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8517#true} is VALID [2022-04-28 05:38:49,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {8604#(<= ~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;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {8604#(<= ~counter~0 1)} call #t~ret8 := main(); {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8604#(<= ~counter~0 1)} {8517#true} #98#return; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {8604#(<= ~counter~0 1)} assume true; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {8604#(<= ~counter~0 1)} is VALID [2022-04-28 05:38:49,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-28 05:38:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 05:38:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:38:49,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843423994] [2022-04-28 05:38:49,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:38:49,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025879627] [2022-04-28 05:38:49,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025879627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:38:49,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:38:49,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 05:38:49,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:38:49,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843285837] [2022-04-28 05:38:49,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843285837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:38:49,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:38:49,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:38:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110877837] [2022-04-28 05:38:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:38:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 05:38:49,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:38:49,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:49,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:49,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:38:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:38:49,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:38:49,654 INFO L87 Difference]: Start difference. First operand 146 states and 198 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:50,129 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-28 05:38:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:38:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 05:38:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:38:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:38:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:38:50,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-28 05:38:50,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:50,207 INFO L225 Difference]: With dead ends: 253 [2022-04-28 05:38:50,207 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 05:38:50,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:38:50,208 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:38:50,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 161 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:38:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 05:38:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-28 05:38:50,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:38:50,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:50,402 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:50,402 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:50,405 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-28 05:38:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-28 05:38:50,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:50,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:50,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-28 05:38:50,406 INFO L87 Difference]: Start difference. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-28 05:38:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:38:50,410 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-28 05:38:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-28 05:38:50,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:38:50,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:38:50,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:38:50,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:38:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:38:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-28 05:38:50,415 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-28 05:38:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:38:50,415 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-28 05:38:50,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 05:38:50,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-28 05:38:50,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:38:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-28 05:38:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 05:38:50,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:38:50,622 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:38:50,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 05:38:50,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 05:38:50,838 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:38:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:38:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-28 05:38:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:38:50,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1428155363] [2022-04-28 05:38:50,839 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:38:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-28 05:38:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:38:50,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300579542] [2022-04-28 05:38:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:38:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:38:50,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:38:50,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078406754] [2022-04-28 05:38:50,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:38:50,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:38:50,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:38:50,850 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:38:50,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 05:38:50,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:38:50,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:38:50,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 05:38:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:38:50,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:38:51,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {10119#true} call ULTIMATE.init(); {10119#true} is VALID [2022-04-28 05:38:51,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10119#true} {10119#true} #98#return; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {10119#true} call #t~ret8 := main(); {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {10119#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {10119#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10119#true} {10119#true} #78#return; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {10119#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,216 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10119#true} {10119#true} #80#return; {10119#true} is VALID [2022-04-28 05:38:51,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {10119#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:51,216 INFO L272 TraceCheckUtils]: 17: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,217 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10119#true} {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:51,217 INFO L272 TraceCheckUtils]: 22: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,217 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10119#true} {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:51,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:51,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:38:51,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {10172#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,219 INFO L272 TraceCheckUtils]: 32: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,219 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10119#true} {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,219 INFO L272 TraceCheckUtils]: 37: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,220 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10119#true} {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,220 INFO L272 TraceCheckUtils]: 42: Hoare triple {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {10119#true} ~cond := #in~cond; {10255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:51,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {10255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:51,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:38:51,221 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} {10212#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,222 INFO L272 TraceCheckUtils]: 47: Hoare triple {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,222 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10119#true} {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:38:51,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {10266#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post6 < 5);havoc #t~post6; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,225 INFO L272 TraceCheckUtils]: 59: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:38:51,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:38:51,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:38:51,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:38:51,225 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10119#true} {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #86#return; {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:38:51,226 INFO L272 TraceCheckUtils]: 64: Hoare triple {10288#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:38:51,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:38:51,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {10326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10120#false} is VALID [2022-04-28 05:38:51,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-04-28 05:38:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:38:51,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:39:06,972 INFO L290 TraceCheckUtils]: 67: Hoare triple {10120#false} assume !false; {10120#false} is VALID [2022-04-28 05:39:06,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {10326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10120#false} is VALID [2022-04-28 05:39:06,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:06,974 INFO L272 TraceCheckUtils]: 64: Hoare triple {10342#(= 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)); {10322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:06,974 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10119#true} {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,974 INFO L290 TraceCheckUtils]: 62: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,975 INFO L272 TraceCheckUtils]: 59: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {10376#(= 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; {10342#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:39:06,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:06,978 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10119#true} {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:06,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,978 INFO L272 TraceCheckUtils]: 47: Hoare triple {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,979 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} {10119#true} #90#return; {10376#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:06,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:06,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {10407#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {10119#true} ~cond := #in~cond; {10407#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:39:06,980 INFO L272 TraceCheckUtils]: 42: Hoare triple {10119#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10119#true} {10119#true} #88#return; {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L272 TraceCheckUtils]: 37: Hoare triple {10119#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10119#true} {10119#true} #86#return; {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L272 TraceCheckUtils]: 32: Hoare triple {10119#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {10119#true} assume !!(#t~post7 < 5);havoc #t~post7; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {10119#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {10119#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {10119#true} assume !!(#t~post6 < 5);havoc #t~post6; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {10119#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10119#true} {10119#true} #84#return; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L272 TraceCheckUtils]: 22: Hoare triple {10119#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10119#true} {10119#true} #82#return; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L272 TraceCheckUtils]: 17: Hoare triple {10119#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {10119#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10119#true} {10119#true} #80#return; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {10119#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10119#true} {10119#true} #78#return; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {10119#true} assume !(0 == ~cond); {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {10119#true} ~cond := #in~cond; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {10119#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {10119#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {10119#true} call #t~ret8 := main(); {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10119#true} {10119#true} #98#return; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {10119#true} assume true; {10119#true} is VALID [2022-04-28 05:39:06,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {10119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {10119#true} is VALID [2022-04-28 05:39:06,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {10119#true} call ULTIMATE.init(); {10119#true} is VALID [2022-04-28 05:39:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:39:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:39:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300579542] [2022-04-28 05:39:06,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:39:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078406754] [2022-04-28 05:39:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078406754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:39:06,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:39:06,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 05:39:06,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:39:06,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1428155363] [2022-04-28 05:39:06,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1428155363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:39:06,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:39:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:39:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243862851] [2022-04-28 05:39:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:39:06,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-28 05:39:06,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:39:06,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:07,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:07,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:39:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:39:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:39:07,025 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:07,920 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-28 05:39:07,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:39:07,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-28 05:39:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:39:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 05:39:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-28 05:39:07,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-28 05:39:08,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:08,009 INFO L225 Difference]: With dead ends: 195 [2022-04-28 05:39:08,009 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 05:39:08,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:39:08,010 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:39:08,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 235 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:39:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 05:39:08,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-28 05:39:08,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:39:08,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,342 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,343 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:08,347 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-28 05:39:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-28 05:39:08,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:08,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:08,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-28 05:39:08,348 INFO L87 Difference]: Start difference. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-28 05:39:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:08,353 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-28 05:39:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-28 05:39:08,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:08,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:08,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:39:08,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:39:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-28 05:39:08,359 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-28 05:39:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:39:08,359 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-28 05:39:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 05:39:08,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-28 05:39:08,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-28 05:39:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:39:08,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:39:08,645 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:39:08,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 05:39:08,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 05:39:08,846 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:39:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:39:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-28 05:39:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:08,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945878668] [2022-04-28 05:39:08,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:39:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-28 05:39:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:39:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984686368] [2022-04-28 05:39:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:39:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:39:08,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:39:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533766177] [2022-04-28 05:39:08,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:39:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:39:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:39:08,885 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:39:08,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 05:39:08,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:39:08,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:39:08,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 05:39:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:39:08,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:39:13,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {11703#true} call ULTIMATE.init(); {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {11703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11703#true} {11703#true} #98#return; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {11703#true} call #t~ret8 := main(); {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {11703#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {11703#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11703#true} {11703#true} #78#return; {11703#true} is VALID [2022-04-28 05:39:13,432 INFO L272 TraceCheckUtils]: 11: Hoare triple {11703#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,433 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11703#true} {11703#true} #80#return; {11703#true} is VALID [2022-04-28 05:39:13,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {11703#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,434 INFO L272 TraceCheckUtils]: 17: Hoare triple {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,438 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11703#true} {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,438 INFO L272 TraceCheckUtils]: 22: Hoare triple {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,439 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11703#true} {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {11756#(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; {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {11756#(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 < 5);havoc #t~post6; {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {11756#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {11796#(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; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {11796#(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 < 5);havoc #t~post7; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,441 INFO L272 TraceCheckUtils]: 32: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,442 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,442 INFO L272 TraceCheckUtils]: 37: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,443 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,443 INFO L272 TraceCheckUtils]: 42: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,444 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,444 INFO L272 TraceCheckUtils]: 47: Hoare triple {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,444 INFO L290 TraceCheckUtils]: 48: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,445 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11703#true} {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {11796#(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); {11796#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:13,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {11796#(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; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,448 INFO L272 TraceCheckUtils]: 59: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,449 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11703#true} {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,449 INFO L272 TraceCheckUtils]: 64: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:13,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,449 INFO L290 TraceCheckUtils]: 66: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,449 INFO L290 TraceCheckUtils]: 67: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,450 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11703#true} {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:39:13,450 INFO L272 TraceCheckUtils]: 69: Hoare triple {11869#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:13,451 INFO L290 TraceCheckUtils]: 70: Hoare triple {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:13,451 INFO L290 TraceCheckUtils]: 71: Hoare triple {11922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11704#false} is VALID [2022-04-28 05:39:13,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {11704#false} assume !false; {11704#false} is VALID [2022-04-28 05:39:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 05:39:13,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:39:13,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {11704#false} assume !false; {11704#false} is VALID [2022-04-28 05:39:13,716 INFO L290 TraceCheckUtils]: 71: Hoare triple {11922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11704#false} is VALID [2022-04-28 05:39:13,717 INFO L290 TraceCheckUtils]: 70: Hoare triple {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:13,717 INFO L272 TraceCheckUtils]: 69: Hoare triple {11938#(= 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)); {11918#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:13,718 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11703#true} {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:13,718 INFO L290 TraceCheckUtils]: 67: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,718 INFO L290 TraceCheckUtils]: 66: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,718 INFO L272 TraceCheckUtils]: 64: Hoare triple {11938#(= 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)); {11703#true} is VALID [2022-04-28 05:39:13,719 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11703#true} {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:13,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:13,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:13,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:13,719 INFO L272 TraceCheckUtils]: 59: Hoare triple {11938#(= 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)); {11703#true} is VALID [2022-04-28 05:39:13,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:13,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:13,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:13,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:13,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:39:15,722 WARN L290 TraceCheckUtils]: 53: Hoare triple {11987#(= (+ (* 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; {11938#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:39:15,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {11987#(= (+ (* 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); {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,723 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #92#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,724 INFO L272 TraceCheckUtils]: 47: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,724 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #90#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,724 INFO L272 TraceCheckUtils]: 42: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,725 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #88#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,738 INFO L272 TraceCheckUtils]: 37: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,739 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11703#true} {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} #86#return; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,739 INFO L272 TraceCheckUtils]: 32: Hoare triple {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {11987#(= (+ (* 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 < 5);havoc #t~post7; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {11987#(= (+ (* 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; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11987#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:39:15,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:15,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:15,742 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11703#true} {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #84#return; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:15,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,742 INFO L272 TraceCheckUtils]: 22: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,743 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11703#true} {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #82#return; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:15,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {11703#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {12060#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:39:15,744 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11703#true} {11703#true} #80#return; {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {11703#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11703#true} {11703#true} #78#return; {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {11703#true} assume !(0 == ~cond); {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} ~cond := #in~cond; {11703#true} is VALID [2022-04-28 05:39:15,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {11703#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {11703#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {11703#true} call #t~ret8 := main(); {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11703#true} {11703#true} #98#return; {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume true; {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {11703#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {11703#true} call ULTIMATE.init(); {11703#true} is VALID [2022-04-28 05:39:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 05:39:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:39:15,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984686368] [2022-04-28 05:39:15,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:39:15,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533766177] [2022-04-28 05:39:15,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533766177] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:39:15,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:39:15,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 05:39:15,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:39:15,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945878668] [2022-04-28 05:39:15,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945878668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:39:15,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:39:15,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:39:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740267792] [2022-04-28 05:39:15,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:39:15,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-28 05:39:15,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:39:15,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:15,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:15,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:39:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:39:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:39:15,792 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:16,455 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-28 05:39:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:39:16,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-28 05:39:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:39:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 05:39:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-28 05:39:16,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-28 05:39:16,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:16,536 INFO L225 Difference]: With dead ends: 199 [2022-04-28 05:39:16,536 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 05:39:16,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:39:16,537 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:39:16,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 234 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:39:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 05:39:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 05:39:16,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:39:16,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:16,758 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:16,758 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:16,762 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-28 05:39:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-28 05:39:16,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:16,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:16,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-28 05:39:16,763 INFO L87 Difference]: Start difference. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-28 05:39:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:39:16,766 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-28 05:39:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-28 05:39:16,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:39:16,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:39:16,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:39:16,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:39:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:39:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-28 05:39:16,771 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-28 05:39:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:39:16,771 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-28 05:39:16,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:39:16,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-28 05:39:16,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:39:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-28 05:39:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 05:39:16,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:39:16,994 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:39:17,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 05:39:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:39:17,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:39:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:39:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-28 05:39:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:39:17,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405527300] [2022-04-28 05:39:17,205 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:39:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-28 05:39:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:39:17,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075957817] [2022-04-28 05:39:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:39:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:39:17,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:39:17,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120905171] [2022-04-28 05:39:17,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:39:17,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:39:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:39:17,228 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:39:17,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 05:39:17,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:39:17,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:39:17,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 05:39:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:39:17,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:39:23,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {13334#true} call ULTIMATE.init(); {13334#true} is VALID [2022-04-28 05:39:23,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {13334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {13334#true} is VALID [2022-04-28 05:39:23,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13334#true} {13334#true} #98#return; {13334#true} is VALID [2022-04-28 05:39:23,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {13334#true} call #t~ret8 := main(); {13334#true} is VALID [2022-04-28 05:39:23,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {13334#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13334#true} is VALID [2022-04-28 05:39:23,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {13334#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {13334#true} ~cond := #in~cond; {13360#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:39:23,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {13360#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13364#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:39:23,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {13364#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13364#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:39:23,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13364#(not (= |assume_abort_if_not_#in~cond| 0))} {13334#true} #78#return; {13371#(<= 1 main_~x~0)} is VALID [2022-04-28 05:39:23,340 INFO L272 TraceCheckUtils]: 11: Hoare triple {13371#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,340 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13334#true} {13371#(<= 1 main_~x~0)} #80#return; {13371#(<= 1 main_~x~0)} is VALID [2022-04-28 05:39:23,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {13371#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,341 INFO L272 TraceCheckUtils]: 17: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,342 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13334#true} {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,342 INFO L272 TraceCheckUtils]: 22: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,343 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13334#true} {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {13390#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,345 INFO L272 TraceCheckUtils]: 32: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,346 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13334#true} {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,346 INFO L272 TraceCheckUtils]: 37: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,346 INFO L290 TraceCheckUtils]: 38: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,346 INFO L290 TraceCheckUtils]: 39: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,347 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13334#true} {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,347 INFO L272 TraceCheckUtils]: 42: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,348 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13334#true} {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,348 INFO L272 TraceCheckUtils]: 47: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,348 INFO L290 TraceCheckUtils]: 48: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,349 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13334#true} {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {13430#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13500#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:39:23,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {13500#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,352 INFO L272 TraceCheckUtils]: 59: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,353 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13334#true} {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,353 INFO L272 TraceCheckUtils]: 64: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {13334#true} ~cond := #in~cond; {13334#true} is VALID [2022-04-28 05:39:23,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {13334#true} assume !(0 == ~cond); {13334#true} is VALID [2022-04-28 05:39:23,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {13334#true} assume true; {13334#true} is VALID [2022-04-28 05:39:23,354 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13334#true} {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,354 INFO L272 TraceCheckUtils]: 69: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13334#true} is VALID [2022-04-28 05:39:23,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {13334#true} ~cond := #in~cond; {13556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:23,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {13556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:23,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:39:23,355 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13560#(not (= |__VERIFIER_assert_#in~cond| 0))} {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:39:23,356 INFO L272 TraceCheckUtils]: 74: Hoare triple {13504#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {13570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:39:23,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {13570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:39:23,357 INFO L290 TraceCheckUtils]: 76: Hoare triple {13574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13335#false} is VALID [2022-04-28 05:39:23,357 INFO L290 TraceCheckUtils]: 77: Hoare triple {13335#false} assume !false; {13335#false} is VALID [2022-04-28 05:39:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-28 05:39:23,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075957817] [2022-04-28 05:40:11,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120905171] [2022-04-28 05:40:11,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120905171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:40:11,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:40:11,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 05:40:11,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405527300] [2022-04-28 05:40:11,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405527300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:11,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:11,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:40:11,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670735412] [2022-04-28 05:40:11,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-28 05:40:11,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:11,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:11,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:11,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:40:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:40:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:40:11,923 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:16,881 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-28 05:40:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:40:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-28 05:40:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 05:40:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-28 05:40:16,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-28 05:40:16,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:16,976 INFO L225 Difference]: With dead ends: 203 [2022-04-28 05:40:16,976 INFO L226 Difference]: Without dead ends: 201 [2022-04-28 05:40:16,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:40:16,976 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:16,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 205 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 05:40:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-28 05:40:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-28 05:40:17,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:17,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:17,260 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:17,260 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:17,263 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-28 05:40:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-28 05:40:17,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:17,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:17,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-28 05:40:17,264 INFO L87 Difference]: Start difference. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-28 05:40:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:17,268 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-28 05:40:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-28 05:40:17,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:17,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:17,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:17,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 05:40:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-28 05:40:17,272 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-28 05:40:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:17,272 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-28 05:40:17,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:40:17,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-28 05:40:17,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-28 05:40:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 05:40:17,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:17,577 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:17,595 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:40:17,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 05:40:17,778 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-28 05:40:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:17,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191217215] [2022-04-28 05:40:17,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:17,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-28 05:40:17,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:17,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909266312] [2022-04-28 05:40:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:17,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:17,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793629445] [2022-04-28 05:40:17,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:40:17,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:17,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:17,790 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:17,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 05:40:17,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:40:17,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:17,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 05:40:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:17,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:18,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {14811#true} call ULTIMATE.init(); {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {14811#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14811#true} {14811#true} #98#return; {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {14811#true} call #t~ret8 := main(); {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {14811#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {14811#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14811#true} {14811#true} #78#return; {14811#true} is VALID [2022-04-28 05:40:18,700 INFO L272 TraceCheckUtils]: 11: Hoare triple {14811#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {14811#true} ~cond := #in~cond; {14852#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:40:18,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {14852#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14856#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:40:18,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {14856#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14856#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:40:18,701 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14856#(not (= |assume_abort_if_not_#in~cond| 0))} {14811#true} #80#return; {14863#(<= 1 main_~y~0)} is VALID [2022-04-28 05:40:18,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {14863#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14867#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:18,701 INFO L272 TraceCheckUtils]: 17: Hoare triple {14867#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14811#true} {14867#(<= 1 main_~b~0)} #82#return; {14867#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:18,702 INFO L272 TraceCheckUtils]: 22: Hoare triple {14867#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,702 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14811#true} {14867#(<= 1 main_~b~0)} #84#return; {14867#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:18,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {14867#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14867#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:18,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {14867#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {14867#(<= 1 main_~b~0)} is VALID [2022-04-28 05:40:18,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {14867#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,704 INFO L272 TraceCheckUtils]: 32: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #86#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,704 INFO L272 TraceCheckUtils]: 37: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,705 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #88#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,705 INFO L272 TraceCheckUtils]: 42: Hoare triple {14907#(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)); {14811#true} is VALID [2022-04-28 05:40:18,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,706 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #90#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,706 INFO L272 TraceCheckUtils]: 47: Hoare triple {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,706 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14811#true} {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #92#return; {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {14907#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,708 INFO L272 TraceCheckUtils]: 55: Hoare triple {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {14811#true} ~cond := #in~cond; {14990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:18,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {14990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:18,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:18,709 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} {14977#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #86#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,709 INFO L272 TraceCheckUtils]: 60: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,709 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14811#true} {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #88#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,710 INFO L272 TraceCheckUtils]: 65: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,712 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14811#true} {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #90#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,712 INFO L272 TraceCheckUtils]: 70: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:18,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:18,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:18,712 INFO L290 TraceCheckUtils]: 73: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:18,713 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14811#true} {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #92#return; {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,714 INFO L290 TraceCheckUtils]: 75: Hoare triple {15001#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-28 05:40:18,715 INFO L272 TraceCheckUtils]: 78: Hoare triple {15050#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:18,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:18,718 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14812#false} is VALID [2022-04-28 05:40:18,718 INFO L290 TraceCheckUtils]: 81: Hoare triple {14812#false} assume !false; {14812#false} is VALID [2022-04-28 05:40:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-28 05:40:18,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:22,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {14812#false} assume !false; {14812#false} is VALID [2022-04-28 05:40:22,123 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14812#false} is VALID [2022-04-28 05:40:22,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15064#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:22,124 INFO L272 TraceCheckUtils]: 78: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15060#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:22,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,125 INFO L290 TraceCheckUtils]: 76: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,127 INFO L290 TraceCheckUtils]: 75: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,127 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14811#true} {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,128 INFO L272 TraceCheckUtils]: 70: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,128 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14811#true} {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,129 INFO L272 TraceCheckUtils]: 65: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,129 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14811#true} {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,130 INFO L272 TraceCheckUtils]: 60: Hoare triple {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,130 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} {14811#true} #86#return; {15080#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:40:22,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:22,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {15147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:22,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {14811#true} ~cond := #in~cond; {15147#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:40:22,132 INFO L272 TraceCheckUtils]: 55: Hoare triple {14811#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {14811#true} assume !!(#t~post7 < 5);havoc #t~post7; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {14811#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {14811#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14811#true} {14811#true} #92#return; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L272 TraceCheckUtils]: 47: Hoare triple {14811#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14811#true} {14811#true} #90#return; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L272 TraceCheckUtils]: 42: Hoare triple {14811#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,132 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14811#true} {14811#true} #88#return; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 39: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L272 TraceCheckUtils]: 37: Hoare triple {14811#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14811#true} {14811#true} #86#return; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L272 TraceCheckUtils]: 32: Hoare triple {14811#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {14811#true} assume !!(#t~post7 < 5);havoc #t~post7; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {14811#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {14811#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {14811#true} assume !!(#t~post6 < 5);havoc #t~post6; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {14811#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14811#true} is VALID [2022-04-28 05:40:22,133 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14811#true} {14811#true} #84#return; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L272 TraceCheckUtils]: 22: Hoare triple {14811#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14811#true} {14811#true} #82#return; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L272 TraceCheckUtils]: 17: Hoare triple {14811#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {14811#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14811#true} {14811#true} #80#return; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,134 INFO L272 TraceCheckUtils]: 11: Hoare triple {14811#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14811#true} {14811#true} #78#return; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {14811#true} assume !(0 == ~cond); {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {14811#true} ~cond := #in~cond; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {14811#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {14811#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {14811#true} call #t~ret8 := main(); {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14811#true} {14811#true} #98#return; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {14811#true} assume true; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {14811#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {14811#true} call ULTIMATE.init(); {14811#true} is VALID [2022-04-28 05:40:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-28 05:40:22,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909266312] [2022-04-28 05:40:22,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793629445] [2022-04-28 05:40:22,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793629445] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:22,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:22,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 16 [2022-04-28 05:40:22,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:22,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191217215] [2022-04-28 05:40:22,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191217215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:22,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:22,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:40:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854142543] [2022-04-28 05:40:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-28 05:40:22,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:22,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:22,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:22,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:40:22,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:22,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:40:22,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:40:22,186 INFO L87 Difference]: Start difference. First operand 198 states and 260 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:26,093 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-28 05:40:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:40:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-28 05:40:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-28 05:40:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-28 05:40:26,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2022-04-28 05:40:26,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:26,211 INFO L225 Difference]: With dead ends: 212 [2022-04-28 05:40:26,211 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 05:40:26,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:40:26,211 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:26,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 240 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 05:40:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 05:40:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-28 05:40:26,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:26,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:26,520 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:26,520 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:26,525 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-28 05:40:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-28 05:40:26,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:26,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:26,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-28 05:40:26,526 INFO L87 Difference]: Start difference. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-28 05:40:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:26,530 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-28 05:40:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-28 05:40:26,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:26,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:26,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:26,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-28 05:40:26,537 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-28 05:40:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:26,539 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-28 05:40:26,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:40:26,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-28 05:40:26,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-28 05:40:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 05:40:26,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:26,899 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:26,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 05:40:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 05:40:27,100 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-28 05:40:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:27,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397179811] [2022-04-28 05:40:27,101 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-28 05:40:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:27,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212816011] [2022-04-28 05:40:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:27,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:27,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912206115] [2022-04-28 05:40:27,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:27,115 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:27,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 05:40:27,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:27,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:27,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:40:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:27,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:27,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {16582#true} call ULTIMATE.init(); {16582#true} is VALID [2022-04-28 05:40:27,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {16582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16590#(<= ~counter~0 0)} {16582#true} #98#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {16590#(<= ~counter~0 0)} call #t~ret8 := main(); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {16590#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,492 INFO L272 TraceCheckUtils]: 6: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,493 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #78#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,493 INFO L272 TraceCheckUtils]: 11: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,494 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #80#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {16590#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,495 INFO L272 TraceCheckUtils]: 17: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,496 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #82#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,496 INFO L272 TraceCheckUtils]: 22: Hoare triple {16590#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {16590#(<= ~counter~0 0)} ~cond := #in~cond; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {16590#(<= ~counter~0 0)} assume !(0 == ~cond); {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {16590#(<= ~counter~0 0)} assume true; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,498 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16590#(<= ~counter~0 0)} {16590#(<= ~counter~0 0)} #84#return; {16590#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:27,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {16590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {16669#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {16669#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {16669#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {16679#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,500 INFO L272 TraceCheckUtils]: 32: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,501 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #86#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,502 INFO L272 TraceCheckUtils]: 37: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,503 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #88#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,504 INFO L272 TraceCheckUtils]: 42: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,505 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #90#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,505 INFO L272 TraceCheckUtils]: 47: Hoare triple {16679#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {16679#(<= ~counter~0 2)} ~cond := #in~cond; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {16679#(<= ~counter~0 2)} assume !(0 == ~cond); {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {16679#(<= ~counter~0 2)} assume true; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,507 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16679#(<= ~counter~0 2)} {16679#(<= ~counter~0 2)} #92#return; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {16679#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {16679#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {16749#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,508 INFO L272 TraceCheckUtils]: 55: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,510 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #86#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,510 INFO L272 TraceCheckUtils]: 60: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,511 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #88#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,512 INFO L272 TraceCheckUtils]: 65: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,513 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #90#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,514 INFO L272 TraceCheckUtils]: 70: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {16749#(<= ~counter~0 3)} ~cond := #in~cond; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {16749#(<= ~counter~0 3)} assume !(0 == ~cond); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,515 INFO L290 TraceCheckUtils]: 73: Hoare triple {16749#(<= ~counter~0 3)} assume true; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,515 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16749#(<= ~counter~0 3)} {16749#(<= ~counter~0 3)} #92#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {16749#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {16749#(<= ~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; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {16749#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16822#(<= |main_#t~post6| 3)} is VALID [2022-04-28 05:40:27,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {16822#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {16583#false} is VALID [2022-04-28 05:40:27,517 INFO L272 TraceCheckUtils]: 79: Hoare triple {16583#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16583#false} is VALID [2022-04-28 05:40:27,517 INFO L290 TraceCheckUtils]: 80: Hoare triple {16583#false} ~cond := #in~cond; {16583#false} is VALID [2022-04-28 05:40:27,517 INFO L290 TraceCheckUtils]: 81: Hoare triple {16583#false} assume 0 == ~cond; {16583#false} is VALID [2022-04-28 05:40:27,517 INFO L290 TraceCheckUtils]: 82: Hoare triple {16583#false} assume !false; {16583#false} is VALID [2022-04-28 05:40:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 05:40:27,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:27,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {16583#false} assume !false; {16583#false} is VALID [2022-04-28 05:40:27,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {16583#false} assume 0 == ~cond; {16583#false} is VALID [2022-04-28 05:40:27,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {16583#false} ~cond := #in~cond; {16583#false} is VALID [2022-04-28 05:40:27,782 INFO L272 TraceCheckUtils]: 79: Hoare triple {16583#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16583#false} is VALID [2022-04-28 05:40:27,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {16850#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {16583#false} is VALID [2022-04-28 05:40:27,783 INFO L290 TraceCheckUtils]: 77: Hoare triple {16854#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16850#(< |main_#t~post6| 5)} is VALID [2022-04-28 05:40:27,783 INFO L290 TraceCheckUtils]: 76: Hoare triple {16854#(< ~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; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {16854#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,783 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #92#return; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,784 INFO L272 TraceCheckUtils]: 70: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,784 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #90#return; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,784 INFO L272 TraceCheckUtils]: 65: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,785 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #88#return; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,785 INFO L272 TraceCheckUtils]: 60: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,786 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16582#true} {16854#(< ~counter~0 5)} #86#return; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,786 INFO L272 TraceCheckUtils]: 55: Hoare triple {16854#(< ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {16854#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {16749#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16854#(< ~counter~0 5)} is VALID [2022-04-28 05:40:27,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {16749#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,787 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #92#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L272 TraceCheckUtils]: 47: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #90#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,788 INFO L272 TraceCheckUtils]: 42: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #88#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L272 TraceCheckUtils]: 37: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16582#true} {16749#(<= ~counter~0 3)} #86#return; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,790 INFO L272 TraceCheckUtils]: 32: Hoare triple {16749#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {16749#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {16679#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16749#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:27,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {16679#(<= ~counter~0 2)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {16679#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {16669#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16679#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:27,791 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #84#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,791 INFO L272 TraceCheckUtils]: 22: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,792 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #82#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,792 INFO L272 TraceCheckUtils]: 17: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {16669#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,792 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #80#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L272 TraceCheckUtils]: 11: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16582#true} {16669#(<= ~counter~0 1)} #78#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {16582#true} assume true; {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {16582#true} assume !(0 == ~cond); {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {16582#true} ~cond := #in~cond; {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {16669#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16582#true} is VALID [2022-04-28 05:40:27,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {16669#(<= ~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;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {16669#(<= ~counter~0 1)} call #t~ret8 := main(); {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16669#(<= ~counter~0 1)} {16582#true} #98#return; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {16669#(<= ~counter~0 1)} assume true; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {16582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {16669#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:27,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {16582#true} call ULTIMATE.init(); {16582#true} is VALID [2022-04-28 05:40:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212816011] [2022-04-28 05:40:27,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:27,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912206115] [2022-04-28 05:40:27,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912206115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:27,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:27,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 05:40:27,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:27,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397179811] [2022-04-28 05:40:27,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397179811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:27,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:27,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:40:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672173176] [2022-04-28 05:40:27,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:27,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-28 05:40:27,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:27,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:27,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:27,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:40:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:40:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:40:27,825 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:28,260 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-28 05:40:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:40:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-28 05:40:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:40:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:40:28,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 05:40:28,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:28,353 INFO L225 Difference]: With dead ends: 214 [2022-04-28 05:40:28,354 INFO L226 Difference]: Without dead ends: 206 [2022-04-28 05:40:28,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:40:28,354 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:28,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 154 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:40:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-28 05:40:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-28 05:40:28,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:28,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:28,582 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:28,582 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:28,585 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-28 05:40:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 05:40:28,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:28,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:28,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-28 05:40:28,587 INFO L87 Difference]: Start difference. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-28 05:40:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:28,590 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-28 05:40:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 05:40:28,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:28,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:28,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:28,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-28 05:40:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-28 05:40:28,595 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-28 05:40:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:28,595 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-28 05:40:28,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:28,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-28 05:40:28,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-28 05:40:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 05:40:28,974 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:28,974 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:29,012 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:40:29,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 05:40:29,175 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-28 05:40:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:29,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992679586] [2022-04-28 05:40:29,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-28 05:40:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285663206] [2022-04-28 05:40:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:29,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:29,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114808229] [2022-04-28 05:40:29,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:29,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:29,189 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:29,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 05:40:29,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:29,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:29,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 05:40:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:29,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:29,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {18344#true} call ULTIMATE.init(); {18344#true} is VALID [2022-04-28 05:40:29,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {18344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {18344#true} is VALID [2022-04-28 05:40:29,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18344#true} {18344#true} #98#return; {18344#true} is VALID [2022-04-28 05:40:29,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {18344#true} call #t~ret8 := main(); {18344#true} is VALID [2022-04-28 05:40:29,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {18344#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {18344#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18344#true} {18344#true} #78#return; {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L272 TraceCheckUtils]: 11: Hoare triple {18344#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,719 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18344#true} {18344#true} #80#return; {18344#true} is VALID [2022-04-28 05:40:29,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {18344#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,722 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18344#true} {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,722 INFO L272 TraceCheckUtils]: 22: Hoare triple {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,722 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18344#true} {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {18397#(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; {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {18397#(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 < 5);havoc #t~post6; {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {18397#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {18437#(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; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {18437#(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 < 5);havoc #t~post7; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,729 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18344#true} {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,729 INFO L272 TraceCheckUtils]: 37: Hoare triple {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,730 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18344#true} {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,730 INFO L272 TraceCheckUtils]: 42: Hoare triple {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,731 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18344#true} {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,731 INFO L272 TraceCheckUtils]: 47: Hoare triple {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,743 INFO L290 TraceCheckUtils]: 48: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,744 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18344#true} {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {18437#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,746 INFO L272 TraceCheckUtils]: 55: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,747 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18344#true} {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,747 INFO L272 TraceCheckUtils]: 60: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,747 INFO L290 TraceCheckUtils]: 61: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,747 INFO L290 TraceCheckUtils]: 63: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,747 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18344#true} {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #88#return; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,748 INFO L272 TraceCheckUtils]: 65: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,748 INFO L290 TraceCheckUtils]: 66: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,748 INFO L290 TraceCheckUtils]: 67: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,748 INFO L290 TraceCheckUtils]: 68: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,748 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18344#true} {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,748 INFO L272 TraceCheckUtils]: 70: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:29,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:29,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:29,749 INFO L290 TraceCheckUtils]: 73: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:29,749 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18344#true} {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:40:29,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {18507#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:40:29,750 INFO L290 TraceCheckUtils]: 77: Hoare triple {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:40:29,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:40:29,751 INFO L290 TraceCheckUtils]: 79: Hoare triple {18580#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:40:29,752 INFO L272 TraceCheckUtils]: 80: Hoare triple {18590#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:29,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:29,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {18598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18345#false} is VALID [2022-04-28 05:40:29,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {18345#false} assume !false; {18345#false} is VALID [2022-04-28 05:40:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:29,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:30,182 INFO L290 TraceCheckUtils]: 83: Hoare triple {18345#false} assume !false; {18345#false} is VALID [2022-04-28 05:40:30,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {18598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18345#false} is VALID [2022-04-28 05:40:30,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:30,183 INFO L272 TraceCheckUtils]: 80: Hoare triple {18614#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {18594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:30,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {18614#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 05:40:30,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:40:30,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:40:32,185 WARN L290 TraceCheckUtils]: 76: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18618#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-28 05:40:32,186 INFO L290 TraceCheckUtils]: 75: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,187 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18344#true} {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #92#return; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,187 INFO L272 TraceCheckUtils]: 70: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,188 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18344#true} {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #90#return; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,188 INFO L272 TraceCheckUtils]: 65: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,189 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18344#true} {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #88#return; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,189 INFO L272 TraceCheckUtils]: 60: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,190 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18344#true} {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #86#return; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,190 INFO L272 TraceCheckUtils]: 55: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,191 INFO L290 TraceCheckUtils]: 53: Hoare triple {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18628#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:40:32,394 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18344#true} {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} #92#return; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,394 INFO L272 TraceCheckUtils]: 47: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,395 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18344#true} {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} #90#return; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,395 INFO L272 TraceCheckUtils]: 42: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,396 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18344#true} {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} #88#return; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,396 INFO L272 TraceCheckUtils]: 37: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,397 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18344#true} {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} #86#return; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,397 INFO L272 TraceCheckUtils]: 32: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18701#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) 0))} is VALID [2022-04-28 05:40:32,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:32,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:32,400 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18344#true} {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #84#return; {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:32,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,400 INFO L272 TraceCheckUtils]: 22: Hoare triple {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,401 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18344#true} {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #82#return; {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:32,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,401 INFO L272 TraceCheckUtils]: 17: Hoare triple {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {18344#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {18771#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:40:32,402 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18344#true} {18344#true} #80#return; {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {18344#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18344#true} {18344#true} #78#return; {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {18344#true} assume !(0 == ~cond); {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {18344#true} ~cond := #in~cond; {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {18344#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18344#true} is VALID [2022-04-28 05:40:32,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {18344#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18344#true} is VALID [2022-04-28 05:40:32,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {18344#true} call #t~ret8 := main(); {18344#true} is VALID [2022-04-28 05:40:32,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18344#true} {18344#true} #98#return; {18344#true} is VALID [2022-04-28 05:40:32,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {18344#true} assume true; {18344#true} is VALID [2022-04-28 05:40:32,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {18344#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {18344#true} is VALID [2022-04-28 05:40:32,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {18344#true} call ULTIMATE.init(); {18344#true} is VALID [2022-04-28 05:40:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285663206] [2022-04-28 05:40:32,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114808229] [2022-04-28 05:40:32,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114808229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:32,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:32,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:40:32,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992679586] [2022-04-28 05:40:32,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992679586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:32,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:32,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:40:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927345921] [2022-04-28 05:40:32,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:32,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-28 05:40:32,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:32,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:32,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:32,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:40:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:40:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:40:32,448 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:33,658 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-28 05:40:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:40:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-28 05:40:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:40:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-28 05:40:33,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-28 05:40:33,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:33,781 INFO L225 Difference]: With dead ends: 234 [2022-04-28 05:40:33,781 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 05:40:33,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:40:33,782 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:33,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:40:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 05:40:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-28 05:40:34,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:34,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:34,118 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:34,119 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:34,123 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-28 05:40:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 05:40:34,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:34,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:34,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-28 05:40:34,125 INFO L87 Difference]: Start difference. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-28 05:40:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:34,129 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-28 05:40:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 05:40:34,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:34,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:34,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:34,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:40:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-28 05:40:34,134 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-28 05:40:34,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:34,134 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-28 05:40:34,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:40:34,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-28 05:40:34,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-28 05:40:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 05:40:34,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:34,498 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:34,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 05:40:34,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:34,699 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-28 05:40:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [246376463] [2022-04-28 05:40:34,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-28 05:40:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21851679] [2022-04-28 05:40:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:34,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:34,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:34,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818568273] [2022-04-28 05:40:34,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:40:34,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:34,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:34,710 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:34,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 05:40:34,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:40:34,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:34,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:40:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:34,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:34,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {20259#true} call ULTIMATE.init(); {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {20259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20259#true} {20259#true} #98#return; {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {20259#true} call #t~ret8 := main(); {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {20259#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {20259#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20259#true} {20259#true} #78#return; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L272 TraceCheckUtils]: 11: Hoare triple {20259#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20259#true} {20259#true} #80#return; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {20259#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L272 TraceCheckUtils]: 17: Hoare triple {20259#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20259#true} {20259#true} #82#return; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L272 TraceCheckUtils]: 22: Hoare triple {20259#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20259#true} {20259#true} #84#return; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {20259#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {20259#true} assume !!(#t~post6 < 5);havoc #t~post6; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {20259#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {20259#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {20259#true} assume !!(#t~post7 < 5);havoc #t~post7; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L272 TraceCheckUtils]: 32: Hoare triple {20259#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20259#true} {20259#true} #86#return; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L272 TraceCheckUtils]: 37: Hoare triple {20259#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20259#true} {20259#true} #88#return; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L272 TraceCheckUtils]: 42: Hoare triple {20259#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20259#true} {20259#true} #90#return; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L272 TraceCheckUtils]: 47: Hoare triple {20259#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,976 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20259#true} {20259#true} #92#return; {20259#true} is VALID [2022-04-28 05:40:34,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {20259#true} assume !(~c~0 >= ~b~0); {20420#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:40:34,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {20420#(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; {20424#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:40:34,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {20424#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20424#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:40:34,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {20424#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {20424#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:40:34,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {20424#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {20434#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {20434#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,979 INFO L272 TraceCheckUtils]: 59: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,980 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #86#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,980 INFO L272 TraceCheckUtils]: 64: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,980 INFO L290 TraceCheckUtils]: 66: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,980 INFO L290 TraceCheckUtils]: 67: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,980 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #88#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,981 INFO L272 TraceCheckUtils]: 69: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,981 INFO L290 TraceCheckUtils]: 70: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,981 INFO L290 TraceCheckUtils]: 71: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,981 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #90#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,981 INFO L272 TraceCheckUtils]: 74: Hoare triple {20434#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {20259#true} is VALID [2022-04-28 05:40:34,982 INFO L290 TraceCheckUtils]: 75: Hoare triple {20259#true} ~cond := #in~cond; {20259#true} is VALID [2022-04-28 05:40:34,982 INFO L290 TraceCheckUtils]: 76: Hoare triple {20259#true} assume !(0 == ~cond); {20259#true} is VALID [2022-04-28 05:40:34,982 INFO L290 TraceCheckUtils]: 77: Hoare triple {20259#true} assume true; {20259#true} is VALID [2022-04-28 05:40:34,982 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20259#true} {20434#(< main_~b~0 main_~c~0)} #92#return; {20434#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 79: Hoare triple {20434#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 80: Hoare triple {20260#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; {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 81: Hoare triple {20260#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 82: Hoare triple {20260#false} assume !(#t~post6 < 5);havoc #t~post6; {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L272 TraceCheckUtils]: 83: Hoare triple {20260#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 84: Hoare triple {20260#false} ~cond := #in~cond; {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 85: Hoare triple {20260#false} assume 0 == ~cond; {20260#false} is VALID [2022-04-28 05:40:34,983 INFO L290 TraceCheckUtils]: 86: Hoare triple {20260#false} assume !false; {20260#false} is VALID [2022-04-28 05:40:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:40:34,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:40:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:34,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21851679] [2022-04-28 05:40:34,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:34,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818568273] [2022-04-28 05:40:34,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818568273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:34,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:34,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:40:34,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:34,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [246376463] [2022-04-28 05:40:34,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [246376463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:34,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:34,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:40:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698315709] [2022-04-28 05:40:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-28 05:40:34,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:34,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:35,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:35,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:40:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:40:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:40:35,031 INFO L87 Difference]: Start difference. First operand 229 states and 306 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:35,814 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-28 05:40:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:40:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-28 05:40:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-28 05:40:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-28 05:40:35,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-28 05:40:35,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:35,905 INFO L225 Difference]: With dead ends: 371 [2022-04-28 05:40:35,906 INFO L226 Difference]: Without dead ends: 291 [2022-04-28 05:40:35,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:40:35,907 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:35,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:40:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-28 05:40:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-28 05:40:36,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:36,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:36,321 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:36,321 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:36,333 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-28 05:40:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-28 05:40:36,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:36,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:36,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-28 05:40:36,334 INFO L87 Difference]: Start difference. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-28 05:40:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:36,340 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-28 05:40:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-28 05:40:36,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:36,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:36,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:36,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-28 05:40:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-28 05:40:36,347 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-28 05:40:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:36,347 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-28 05:40:36,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:40:36,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-28 05:40:36,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-28 05:40:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:40:36,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:36,692 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:36,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 05:40:36,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:36,907 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:36,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-28 05:40:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1968153885] [2022-04-28 05:40:36,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-28 05:40:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757111042] [2022-04-28 05:40:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:36,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:36,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30918173] [2022-04-28 05:40:36,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:36,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:36,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:36,920 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:36,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 05:40:36,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:36,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:36,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 05:40:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:36,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:39,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {22367#true} call ULTIMATE.init(); {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {22367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22367#true} {22367#true} #98#return; {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {22367#true} call #t~ret8 := main(); {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {22367#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {22367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22367#true} {22367#true} #78#return; {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {22367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22367#true} {22367#true} #80#return; {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {22367#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,279 INFO L272 TraceCheckUtils]: 17: Hoare triple {22420#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,280 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #82#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,280 INFO L272 TraceCheckUtils]: 22: Hoare triple {22420#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,280 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #84#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {22420#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {22420#(= main_~q~0 0)} assume !!(#t~post6 < 5);havoc #t~post6; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {22420#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {22420#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {22420#(= main_~q~0 0)} assume !!(#t~post7 < 5);havoc #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,290 INFO L272 TraceCheckUtils]: 32: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,291 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #86#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,291 INFO L272 TraceCheckUtils]: 37: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,292 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #88#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,292 INFO L272 TraceCheckUtils]: 42: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,293 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #90#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,293 INFO L272 TraceCheckUtils]: 47: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,294 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #92#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {22420#(= main_~q~0 0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {22420#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {22420#(= main_~q~0 0)} assume !!(#t~post7 < 5);havoc #t~post7; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,295 INFO L272 TraceCheckUtils]: 55: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,296 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #86#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,296 INFO L272 TraceCheckUtils]: 60: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,297 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22367#true} {22420#(= main_~q~0 0)} #88#return; {22420#(= main_~q~0 0)} is VALID [2022-04-28 05:40:39,297 INFO L272 TraceCheckUtils]: 65: Hoare triple {22420#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,297 INFO L290 TraceCheckUtils]: 66: Hoare triple {22367#true} ~cond := #in~cond; {22571#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:39,298 INFO L290 TraceCheckUtils]: 67: Hoare triple {22571#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:39,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:39,299 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} {22420#(= main_~q~0 0)} #90#return; {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 05:40:39,299 INFO L272 TraceCheckUtils]: 70: Hoare triple {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,299 INFO L290 TraceCheckUtils]: 71: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,299 INFO L290 TraceCheckUtils]: 73: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,300 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22367#true} {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #92#return; {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 05:40:39,300 INFO L290 TraceCheckUtils]: 75: Hoare triple {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 05:40:39,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {22582#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:39,301 INFO L290 TraceCheckUtils]: 77: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:39,301 INFO L290 TraceCheckUtils]: 78: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !!(#t~post6 < 5);havoc #t~post6; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:39,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !(0 != ~b~0); {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:39,302 INFO L272 TraceCheckUtils]: 80: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:39,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:39,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:39,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:39,303 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22367#true} {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #94#return; {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-28 05:40:39,303 INFO L272 TraceCheckUtils]: 85: Hoare triple {22604#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:39,304 INFO L290 TraceCheckUtils]: 86: Hoare triple {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:39,304 INFO L290 TraceCheckUtils]: 87: Hoare triple {22636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22368#false} is VALID [2022-04-28 05:40:39,304 INFO L290 TraceCheckUtils]: 88: Hoare triple {22368#false} assume !false; {22368#false} is VALID [2022-04-28 05:40:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-28 05:40:39,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:40:57,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {22368#false} assume !false; {22368#false} is VALID [2022-04-28 05:40:57,226 INFO L290 TraceCheckUtils]: 87: Hoare triple {22636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22368#false} is VALID [2022-04-28 05:40:57,226 INFO L290 TraceCheckUtils]: 86: Hoare triple {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:40:57,227 INFO L272 TraceCheckUtils]: 85: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:40:57,227 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22367#true} {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #94#return; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:57,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,227 INFO L290 TraceCheckUtils]: 81: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,227 INFO L272 TraceCheckUtils]: 80: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:57,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:57,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:57,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {22680#(= 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; {22652#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:40:57,229 INFO L290 TraceCheckUtils]: 75: Hoare triple {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:40:57,230 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22367#true} {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:40:57,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,230 INFO L290 TraceCheckUtils]: 72: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,230 INFO L272 TraceCheckUtils]: 70: Hoare triple {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,231 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} {22367#true} #90#return; {22680#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:40:57,231 INFO L290 TraceCheckUtils]: 68: Hoare triple {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:57,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {22711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {22367#true} ~cond := #in~cond; {22711#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:40:57,232 INFO L272 TraceCheckUtils]: 65: Hoare triple {22367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22367#true} {22367#true} #88#return; {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L272 TraceCheckUtils]: 60: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22367#true} {22367#true} #86#return; {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,232 INFO L272 TraceCheckUtils]: 55: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {22367#true} assume !!(#t~post7 < 5);havoc #t~post7; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {22367#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {22367#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22367#true} {22367#true} #92#return; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L272 TraceCheckUtils]: 47: Hoare triple {22367#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22367#true} {22367#true} #90#return; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L272 TraceCheckUtils]: 42: Hoare triple {22367#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,233 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22367#true} {22367#true} #88#return; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L272 TraceCheckUtils]: 37: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22367#true} {22367#true} #86#return; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L272 TraceCheckUtils]: 32: Hoare triple {22367#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {22367#true} assume !!(#t~post7 < 5);havoc #t~post7; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {22367#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {22367#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {22367#true} assume !!(#t~post6 < 5);havoc #t~post6; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {22367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22367#true} is VALID [2022-04-28 05:40:57,234 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22367#true} {22367#true} #84#return; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L272 TraceCheckUtils]: 22: Hoare triple {22367#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22367#true} {22367#true} #82#return; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L272 TraceCheckUtils]: 17: Hoare triple {22367#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {22367#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22367#true} {22367#true} #80#return; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L272 TraceCheckUtils]: 11: Hoare triple {22367#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22367#true} {22367#true} #78#return; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {22367#true} assume !(0 == ~cond); {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {22367#true} ~cond := #in~cond; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {22367#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {22367#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {22367#true} call #t~ret8 := main(); {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22367#true} {22367#true} #98#return; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {22367#true} assume true; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {22367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {22367#true} call ULTIMATE.init(); {22367#true} is VALID [2022-04-28 05:40:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-28 05:40:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:40:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757111042] [2022-04-28 05:40:57,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:40:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30918173] [2022-04-28 05:40:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30918173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:40:57,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:40:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 05:40:57,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:40:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1968153885] [2022-04-28 05:40:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1968153885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:40:57,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:40:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:40:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546567224] [2022-04-28 05:40:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:40:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-28 05:40:57,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:40:57,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:57,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:57,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:40:57,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:40:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:40:57,274 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:58,419 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-28 05:40:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:40:58,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-28 05:40:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:40:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-28 05:40:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-28 05:40:58,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-28 05:40:58,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:58,502 INFO L225 Difference]: With dead ends: 301 [2022-04-28 05:40:58,502 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 05:40:58,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:40:58,504 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:40:58,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 237 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:40:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 05:40:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-28 05:40:58,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:40:58,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:58,980 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:58,980 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:58,986 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-28 05:40:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-28 05:40:58,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:58,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:58,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-28 05:40:58,987 INFO L87 Difference]: Start difference. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-28 05:40:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:40:58,993 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-28 05:40:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-28 05:40:58,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:40:58,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:40:58,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:40:58,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:40:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:40:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-28 05:40:59,000 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-28 05:40:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:40:59,000 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-28 05:40:59,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 05:40:59,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-28 05:40:59,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:40:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-28 05:40:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:40:59,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:40:59,394 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:40:59,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 05:40:59,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 05:40:59,594 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:40:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:40:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-28 05:40:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:40:59,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780610419] [2022-04-28 05:40:59,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:40:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-28 05:40:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:40:59,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936690977] [2022-04-28 05:40:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:40:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:40:59,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:40:59,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629866346] [2022-04-28 05:40:59,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:40:59,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:40:59,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:40:59,605 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:40:59,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 05:40:59,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:40:59,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:40:59,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:40:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:40:59,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:40:59,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {24698#true} call ULTIMATE.init(); {24698#true} is VALID [2022-04-28 05:40:59,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {24698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24706#(<= ~counter~0 0)} {24698#true} #98#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {24706#(<= ~counter~0 0)} call #t~ret8 := main(); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {24706#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,974 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #78#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,974 INFO L272 TraceCheckUtils]: 11: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,975 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #80#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {24706#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,976 INFO L272 TraceCheckUtils]: 17: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,977 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #82#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,978 INFO L272 TraceCheckUtils]: 22: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {24706#(<= ~counter~0 0)} ~cond := #in~cond; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {24706#(<= ~counter~0 0)} assume !(0 == ~cond); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,979 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24706#(<= ~counter~0 0)} {24706#(<= ~counter~0 0)} #84#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:40:59,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {24706#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:59,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {24785#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:59,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {24785#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24785#(<= ~counter~0 1)} is VALID [2022-04-28 05:40:59,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {24785#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {24795#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,981 INFO L272 TraceCheckUtils]: 32: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,983 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #86#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,983 INFO L272 TraceCheckUtils]: 37: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,985 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #88#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,985 INFO L272 TraceCheckUtils]: 42: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,986 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #90#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,987 INFO L272 TraceCheckUtils]: 47: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {24795#(<= ~counter~0 2)} ~cond := #in~cond; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {24795#(<= ~counter~0 2)} assume !(0 == ~cond); {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {24795#(<= ~counter~0 2)} assume true; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,989 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24795#(<= ~counter~0 2)} {24795#(<= ~counter~0 2)} #92#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {24795#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:40:59,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {24795#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {24865#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,990 INFO L272 TraceCheckUtils]: 55: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,991 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #86#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,992 INFO L272 TraceCheckUtils]: 60: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,993 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #88#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,994 INFO L272 TraceCheckUtils]: 65: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,996 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #90#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,996 INFO L272 TraceCheckUtils]: 70: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,997 INFO L290 TraceCheckUtils]: 71: Hoare triple {24865#(<= ~counter~0 3)} ~cond := #in~cond; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {24865#(<= ~counter~0 3)} assume !(0 == ~cond); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {24865#(<= ~counter~0 3)} assume true; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,998 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24865#(<= ~counter~0 3)} {24865#(<= ~counter~0 3)} #92#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,998 INFO L290 TraceCheckUtils]: 75: Hoare triple {24865#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,999 INFO L290 TraceCheckUtils]: 76: Hoare triple {24865#(<= ~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; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:40:59,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {24865#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-28 05:40:59,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {24938#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-28 05:41:00,000 INFO L290 TraceCheckUtils]: 79: Hoare triple {24938#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24938#(<= ~counter~0 4)} is VALID [2022-04-28 05:41:00,000 INFO L290 TraceCheckUtils]: 80: Hoare triple {24938#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24948#(<= |main_#t~post7| 4)} is VALID [2022-04-28 05:41:00,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {24948#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {24699#false} is VALID [2022-04-28 05:41:00,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {24699#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; {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {24699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {24699#false} assume !(#t~post6 < 5);havoc #t~post6; {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L272 TraceCheckUtils]: 85: Hoare triple {24699#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {24699#false} ~cond := #in~cond; {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {24699#false} assume 0 == ~cond; {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {24699#false} assume !false; {24699#false} is VALID [2022-04-28 05:41:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 05:41:00,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {24699#false} assume !false; {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {24699#false} assume 0 == ~cond; {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {24699#false} ~cond := #in~cond; {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L272 TraceCheckUtils]: 85: Hoare triple {24699#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {24699#false} assume !(#t~post6 < 5);havoc #t~post6; {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {24699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {24699#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; {24699#false} is VALID [2022-04-28 05:41:00,371 INFO L290 TraceCheckUtils]: 81: Hoare triple {24948#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {24699#false} is VALID [2022-04-28 05:41:00,372 INFO L290 TraceCheckUtils]: 80: Hoare triple {24938#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24948#(<= |main_#t~post7| 4)} is VALID [2022-04-28 05:41:00,372 INFO L290 TraceCheckUtils]: 79: Hoare triple {24938#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24938#(<= ~counter~0 4)} is VALID [2022-04-28 05:41:00,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {24938#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-28 05:41:00,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {24865#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24938#(<= ~counter~0 4)} is VALID [2022-04-28 05:41:00,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {24865#(<= ~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; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,374 INFO L290 TraceCheckUtils]: 75: Hoare triple {24865#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,374 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #92#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,374 INFO L290 TraceCheckUtils]: 73: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,375 INFO L272 TraceCheckUtils]: 70: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,375 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #90#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,376 INFO L272 TraceCheckUtils]: 65: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,376 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #88#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,376 INFO L272 TraceCheckUtils]: 60: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,377 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24698#true} {24865#(<= ~counter~0 3)} #86#return; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,377 INFO L272 TraceCheckUtils]: 55: Hoare triple {24865#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {24865#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {24795#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24865#(<= ~counter~0 3)} is VALID [2022-04-28 05:41:00,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {24795#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,379 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #92#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,379 INFO L272 TraceCheckUtils]: 47: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,380 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #90#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,380 INFO L272 TraceCheckUtils]: 42: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,380 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #88#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,381 INFO L272 TraceCheckUtils]: 37: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,381 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24698#true} {24795#(<= ~counter~0 2)} #86#return; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,382 INFO L272 TraceCheckUtils]: 32: Hoare triple {24795#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {24795#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {24785#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24795#(<= ~counter~0 2)} is VALID [2022-04-28 05:41:00,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {24785#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24785#(<= ~counter~0 1)} is VALID [2022-04-28 05:41:00,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {24785#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-28 05:41:00,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {24706#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24785#(<= ~counter~0 1)} is VALID [2022-04-28 05:41:00,384 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #84#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,384 INFO L272 TraceCheckUtils]: 22: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #82#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,385 INFO L272 TraceCheckUtils]: 17: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {24706#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,385 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #80#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24698#true} {24706#(<= ~counter~0 0)} #78#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {24698#true} assume true; {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {24698#true} assume !(0 == ~cond); {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {24698#true} ~cond := #in~cond; {24698#true} is VALID [2022-04-28 05:41:00,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {24706#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24698#true} is VALID [2022-04-28 05:41:00,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {24706#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {24706#(<= ~counter~0 0)} call #t~ret8 := main(); {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24706#(<= ~counter~0 0)} {24698#true} #98#return; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {24706#(<= ~counter~0 0)} assume true; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {24698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {24706#(<= ~counter~0 0)} is VALID [2022-04-28 05:41:00,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {24698#true} call ULTIMATE.init(); {24698#true} is VALID [2022-04-28 05:41:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 05:41:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:41:00,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936690977] [2022-04-28 05:41:00,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:41:00,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629866346] [2022-04-28 05:41:00,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629866346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:41:00,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:41:00,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:41:00,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:41:00,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780610419] [2022-04-28 05:41:00,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780610419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:41:00,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:41:00,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:41:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168193770] [2022-04-28 05:41:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:41:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-28 05:41:00,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:41:00,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:41:00,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:41:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:41:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:41:00,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:41:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:41:00,447 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:41:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:41:01,298 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-28 05:41:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:41:01,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-28 05:41:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:41:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:41:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-28 05:41:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:41:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-28 05:41:01,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-28 05:41:01,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:41:01,403 INFO L225 Difference]: With dead ends: 463 [2022-04-28 05:41:01,403 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 05:41:01,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:41:01,404 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:41:01,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 162 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:41:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 05:41:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-28 05:41:01,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:41:01,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:41:01,898 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:41:01,898 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:41:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:41:01,904 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-28 05:41:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-28 05:41:01,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:41:01,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:41:01,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-28 05:41:01,905 INFO L87 Difference]: Start difference. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-28 05:41:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:41:01,911 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-28 05:41:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-28 05:41:01,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:41:01,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:41:01,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:41:01,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:41:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:41:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-28 05:41:01,919 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-28 05:41:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:41:01,919 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-28 05:41:01,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 05:41:01,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-28 05:41:02,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:41:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-28 05:41:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 05:41:02,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:41:02,476 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:41:02,497 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:41:02,677 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:41:02,677 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:41:02,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:41:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-28 05:41:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:41:02,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1595524458] [2022-04-28 05:41:02,678 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:41:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-28 05:41:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:41:02,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032295161] [2022-04-28 05:41:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:41:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:41:02,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:41:02,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852068754] [2022-04-28 05:41:02,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:41:02,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:41:02,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:41:02,695 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:41:02,727 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:41:02,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:41:02,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:41:02,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 05:41:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:41:02,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:41:06,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {27483#true} call ULTIMATE.init(); {27483#true} is VALID [2022-04-28 05:41:06,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {27483#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {27483#true} is VALID [2022-04-28 05:41:06,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27483#true} {27483#true} #98#return; {27483#true} is VALID [2022-04-28 05:41:06,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {27483#true} call #t~ret8 := main(); {27483#true} is VALID [2022-04-28 05:41:06,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {27483#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {27483#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27483#true} {27483#true} #78#return; {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L272 TraceCheckUtils]: 11: Hoare triple {27483#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {27483#true} ~cond := #in~cond; {27524#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:41:06,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {27524#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27528#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:41:06,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {27528#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27528#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:41:06,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27528#(not (= |assume_abort_if_not_#in~cond| 0))} {27483#true} #80#return; {27535#(<= 1 main_~y~0)} is VALID [2022-04-28 05:41:06,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {27535#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,774 INFO L272 TraceCheckUtils]: 17: Hoare triple {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,775 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27483#true} {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,775 INFO L272 TraceCheckUtils]: 22: Hoare triple {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,775 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27483#true} {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {27539#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,778 INFO L272 TraceCheckUtils]: 32: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,779 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27483#true} {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,779 INFO L272 TraceCheckUtils]: 37: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,780 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27483#true} {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #88#return; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,780 INFO L272 TraceCheckUtils]: 42: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,781 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27483#true} {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #90#return; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,781 INFO L272 TraceCheckUtils]: 47: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,782 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {27483#true} {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #92#return; {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {27579#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:41:06,784 INFO L272 TraceCheckUtils]: 55: Hoare triple {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:06,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,786 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27649#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:06,786 INFO L272 TraceCheckUtils]: 60: Hoare triple {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,787 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27483#true} {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:06,787 INFO L272 TraceCheckUtils]: 65: Hoare triple {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,787 INFO L290 TraceCheckUtils]: 66: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:06,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,788 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:06,789 INFO L272 TraceCheckUtils]: 70: Hoare triple {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,789 INFO L290 TraceCheckUtils]: 71: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:06,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,789 INFO L290 TraceCheckUtils]: 73: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,790 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:41:06,791 INFO L290 TraceCheckUtils]: 75: Hoare triple {27673#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {27722#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))))} is VALID [2022-04-28 05:41:06,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {27722#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,792 INFO L290 TraceCheckUtils]: 78: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,793 INFO L290 TraceCheckUtils]: 80: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post7 < 5);havoc #t~post7; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,794 INFO L272 TraceCheckUtils]: 82: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,795 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27483#true} {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #86#return; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,795 INFO L272 TraceCheckUtils]: 87: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {27483#true} ~cond := #in~cond; {27483#true} is VALID [2022-04-28 05:41:06,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {27483#true} assume !(0 == ~cond); {27483#true} is VALID [2022-04-28 05:41:06,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {27483#true} assume true; {27483#true} is VALID [2022-04-28 05:41:06,796 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27483#true} {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #88#return; {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,796 INFO L272 TraceCheckUtils]: 92: Hoare triple {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27483#true} is VALID [2022-04-28 05:41:06,796 INFO L290 TraceCheckUtils]: 93: Hoare triple {27483#true} ~cond := #in~cond; {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:06,796 INFO L290 TraceCheckUtils]: 94: Hoare triple {27662#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,796 INFO L290 TraceCheckUtils]: 95: Hoare triple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:41:06,797 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27666#(not (= |__VERIFIER_assert_#in~cond| 0))} {27726#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #90#return; {27787#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:41:06,799 INFO L272 TraceCheckUtils]: 97: Hoare triple {27787#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:41:06,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {27791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:41:06,800 INFO L290 TraceCheckUtils]: 99: Hoare triple {27795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27484#false} is VALID [2022-04-28 05:41:06,800 INFO L290 TraceCheckUtils]: 100: Hoare triple {27484#false} assume !false; {27484#false} is VALID [2022-04-28 05:41:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 84 proven. 53 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-28 05:41:06,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:41:38,047 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:42:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:42:16,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032295161] [2022-04-28 05:42:16,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:42:16,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852068754] [2022-04-28 05:42:16,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852068754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:42:16,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:42:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 05:42:16,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:42:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1595524458] [2022-04-28 05:42:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1595524458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:42:16,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:42:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:42:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984871191] [2022-04-28 05:42:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:42:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-28 05:42:16,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:42:16,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:16,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:42:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:16,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:42:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2022-04-28 05:42:16,478 INFO L87 Difference]: Start difference. First operand 327 states and 433 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:31,355 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-28 05:42:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:42:31,355 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-28 05:42:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:42:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 05:42:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-28 05:42:31,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-28 05:42:31,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:31,503 INFO L225 Difference]: With dead ends: 339 [2022-04-28 05:42:31,503 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 05:42:31,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=122, Invalid=527, Unknown=1, NotChecked=0, Total=650 [2022-04-28 05:42:31,503 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:42:31,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 324 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 05:42:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 05:42:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-28 05:42:32,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:42:32,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:32,093 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:32,093 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:32,099 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-28 05:42:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-28 05:42:32,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:32,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:32,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-28 05:42:32,100 INFO L87 Difference]: Start difference. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-28 05:42:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:32,106 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-28 05:42:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-28 05:42:32,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:32,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:32,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:42:32,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:42:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:32,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-28 05:42:32,114 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-28 05:42:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:42:32,115 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-28 05:42:32,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-28 05:42:32,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-28 05:42:32,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-28 05:42:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 05:42:32,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:42:32,725 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:42:32,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 05:42:32,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:32,926 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:42:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:42:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-28 05:42:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:32,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611391110] [2022-04-28 05:42:32,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:42:32,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-28 05:42:32,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:42:32,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317934684] [2022-04-28 05:42:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:42:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:42:32,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:42:32,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3376127] [2022-04-28 05:42:32,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:42:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:32,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:42:32,952 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:42:32,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 05:42:33,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:42:33,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:42:33,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 05:42:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:42:33,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:42:33,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {29918#true} call ULTIMATE.init(); {29918#true} is VALID [2022-04-28 05:42:33,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {29918#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {29918#true} is VALID [2022-04-28 05:42:33,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29918#true} {29918#true} #98#return; {29918#true} is VALID [2022-04-28 05:42:33,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {29918#true} call #t~ret8 := main(); {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {29918#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {29918#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29918#true} {29918#true} #78#return; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L272 TraceCheckUtils]: 11: Hoare triple {29918#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29918#true} {29918#true} #80#return; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {29918#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L272 TraceCheckUtils]: 17: Hoare triple {29918#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29918#true} {29918#true} #82#return; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L272 TraceCheckUtils]: 22: Hoare triple {29918#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29918#true} {29918#true} #84#return; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {29918#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {29918#true} assume !!(#t~post6 < 5);havoc #t~post6; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {29918#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L272 TraceCheckUtils]: 32: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L272 TraceCheckUtils]: 37: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L272 TraceCheckUtils]: 42: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L272 TraceCheckUtils]: 47: Hoare triple {29918#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 54: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L272 TraceCheckUtils]: 55: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L272 TraceCheckUtils]: 60: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L272 TraceCheckUtils]: 65: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L272 TraceCheckUtils]: 70: Hoare triple {29918#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 71: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 76: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-28 05:42:33,271 INFO L272 TraceCheckUtils]: 78: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,272 INFO L290 TraceCheckUtils]: 79: Hoare triple {29918#true} ~cond := #in~cond; {30160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:33,272 INFO L290 TraceCheckUtils]: 80: Hoare triple {30160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:33,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:33,273 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} {29918#true} #86#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,273 INFO L272 TraceCheckUtils]: 83: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,273 INFO L290 TraceCheckUtils]: 84: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,273 INFO L290 TraceCheckUtils]: 85: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,273 INFO L290 TraceCheckUtils]: 86: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,274 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,274 INFO L272 TraceCheckUtils]: 88: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,274 INFO L290 TraceCheckUtils]: 89: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,274 INFO L290 TraceCheckUtils]: 90: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,274 INFO L290 TraceCheckUtils]: 91: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,275 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,275 INFO L272 TraceCheckUtils]: 93: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:33,275 INFO L290 TraceCheckUtils]: 94: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:33,275 INFO L290 TraceCheckUtils]: 95: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:33,275 INFO L290 TraceCheckUtils]: 96: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:33,276 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,277 INFO L290 TraceCheckUtils]: 98: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,278 INFO L290 TraceCheckUtils]: 99: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,278 INFO L290 TraceCheckUtils]: 100: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:33,278 INFO L272 TraceCheckUtils]: 101: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:42:33,279 INFO L290 TraceCheckUtils]: 102: Hoare triple {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:33,279 INFO L290 TraceCheckUtils]: 103: Hoare triple {30233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29919#false} is VALID [2022-04-28 05:42:33,279 INFO L290 TraceCheckUtils]: 104: Hoare triple {29919#false} assume !false; {29919#false} is VALID [2022-04-28 05:42:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:42:33,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:42:43,643 INFO L290 TraceCheckUtils]: 104: Hoare triple {29919#false} assume !false; {29919#false} is VALID [2022-04-28 05:42:43,644 INFO L290 TraceCheckUtils]: 103: Hoare triple {30233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29919#false} is VALID [2022-04-28 05:42:43,644 INFO L290 TraceCheckUtils]: 102: Hoare triple {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:43,645 INFO L272 TraceCheckUtils]: 101: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:42:43,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,645 INFO L290 TraceCheckUtils]: 99: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,648 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,648 INFO L290 TraceCheckUtils]: 96: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,648 INFO L290 TraceCheckUtils]: 95: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,648 INFO L290 TraceCheckUtils]: 94: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,648 INFO L272 TraceCheckUtils]: 93: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,649 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,649 INFO L290 TraceCheckUtils]: 91: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,649 INFO L290 TraceCheckUtils]: 90: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,649 INFO L272 TraceCheckUtils]: 88: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,650 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29918#true} {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,650 INFO L290 TraceCheckUtils]: 86: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,650 INFO L290 TraceCheckUtils]: 85: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,650 INFO L290 TraceCheckUtils]: 84: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,650 INFO L272 TraceCheckUtils]: 83: Hoare triple {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,651 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} {29918#true} #86#return; {30171#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:42:43,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:43,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {30315#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:43,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {29918#true} ~cond := #in~cond; {30315#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:42:43,652 INFO L272 TraceCheckUtils]: 78: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 75: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 73: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 72: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L272 TraceCheckUtils]: 70: Hoare triple {29918#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L272 TraceCheckUtils]: 65: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,652 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 61: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L272 TraceCheckUtils]: 60: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L272 TraceCheckUtils]: 55: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {29918#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29918#true} {29918#true} #92#return; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L272 TraceCheckUtils]: 47: Hoare triple {29918#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29918#true} {29918#true} #90#return; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L272 TraceCheckUtils]: 42: Hoare triple {29918#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29918#true} {29918#true} #88#return; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L272 TraceCheckUtils]: 37: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29918#true} {29918#true} #86#return; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L272 TraceCheckUtils]: 32: Hoare triple {29918#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {29918#true} assume !!(#t~post7 < 5);havoc #t~post7; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {29918#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {29918#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {29918#true} assume !!(#t~post6 < 5);havoc #t~post6; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {29918#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29918#true} {29918#true} #84#return; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L272 TraceCheckUtils]: 22: Hoare triple {29918#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29918#true} {29918#true} #82#return; {29918#true} is VALID [2022-04-28 05:42:43,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L272 TraceCheckUtils]: 17: Hoare triple {29918#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {29918#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29918#true} {29918#true} #80#return; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {29918#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29918#true} {29918#true} #78#return; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {29918#true} assume !(0 == ~cond); {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {29918#true} ~cond := #in~cond; {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {29918#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29918#true} is VALID [2022-04-28 05:42:43,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {29918#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29918#true} is VALID [2022-04-28 05:42:43,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {29918#true} call #t~ret8 := main(); {29918#true} is VALID [2022-04-28 05:42:43,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29918#true} {29918#true} #98#return; {29918#true} is VALID [2022-04-28 05:42:43,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {29918#true} assume true; {29918#true} is VALID [2022-04-28 05:42:43,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {29918#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {29918#true} is VALID [2022-04-28 05:42:43,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {29918#true} call ULTIMATE.init(); {29918#true} is VALID [2022-04-28 05:42:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 05:42:43,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:42:43,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317934684] [2022-04-28 05:42:43,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:42:43,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3376127] [2022-04-28 05:42:43,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3376127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:42:43,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:42:43,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-28 05:42:43,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:42:43,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611391110] [2022-04-28 05:42:43,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611391110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:42:43,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:42:43,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:42:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583309748] [2022-04-28 05:42:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:42:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-28 05:42:43,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:42:43,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:43,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:43,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:42:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:43,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:42:43,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:42:43,698 INFO L87 Difference]: Start difference. First operand 335 states and 439 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:44,266 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-28 05:42:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:42:44,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-28 05:42:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:42:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 05:42:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 05:42:44,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 05:42:44,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:44,331 INFO L225 Difference]: With dead ends: 341 [2022-04-28 05:42:44,331 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 05:42:44,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:42:44,332 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:42:44,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:42:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 05:42:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-28 05:42:45,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:42:45,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,043 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,043 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:45,049 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-28 05:42:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 05:42:45,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:45,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:45,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-28 05:42:45,051 INFO L87 Difference]: Start difference. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-28 05:42:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:45,057 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-28 05:42:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 05:42:45,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:45,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:45,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:42:45,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:42:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-28 05:42:45,065 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-28 05:42:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:42:45,066 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-28 05:42:45,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-28 05:42:45,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-28 05:42:45,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-28 05:42:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 05:42:45,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:42:45,668 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:42:45,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 05:42:45,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:45,868 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:42:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:42:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-28 05:42:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:45,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932563829] [2022-04-28 05:42:45,869 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:42:45,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-28 05:42:45,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:42:45,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863290018] [2022-04-28 05:42:45,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:42:45,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:42:45,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:42:45,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684600878] [2022-04-28 05:42:45,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:42:45,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:42:45,886 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:42:45,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 05:42:45,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:42:45,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:42:45,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:42:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:42:45,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:42:46,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {32597#true} call ULTIMATE.init(); {32597#true} is VALID [2022-04-28 05:42:46,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {32597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32605#(<= ~counter~0 0)} {32597#true} #98#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {32605#(<= ~counter~0 0)} call #t~ret8 := main(); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {32605#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #78#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,373 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #80#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {32605#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,374 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #82#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,375 INFO L272 TraceCheckUtils]: 22: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {32605#(<= ~counter~0 0)} ~cond := #in~cond; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {32605#(<= ~counter~0 0)} assume !(0 == ~cond); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,376 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32605#(<= ~counter~0 0)} {32605#(<= ~counter~0 0)} #84#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {32605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:46,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {32684#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:46,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {32684#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32684#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:46,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {32684#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {32694#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,378 INFO L272 TraceCheckUtils]: 32: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,379 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #86#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,379 INFO L272 TraceCheckUtils]: 37: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,380 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #88#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,381 INFO L272 TraceCheckUtils]: 42: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,382 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #90#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,382 INFO L272 TraceCheckUtils]: 47: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {32694#(<= ~counter~0 2)} ~cond := #in~cond; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {32694#(<= ~counter~0 2)} assume !(0 == ~cond); {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {32694#(<= ~counter~0 2)} assume true; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,383 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32694#(<= ~counter~0 2)} {32694#(<= ~counter~0 2)} #92#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {32694#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {32694#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {32764#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,384 INFO L272 TraceCheckUtils]: 55: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,385 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #86#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,386 INFO L272 TraceCheckUtils]: 60: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,386 INFO L290 TraceCheckUtils]: 61: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,387 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #88#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,387 INFO L272 TraceCheckUtils]: 65: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,388 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #90#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,389 INFO L272 TraceCheckUtils]: 70: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,389 INFO L290 TraceCheckUtils]: 71: Hoare triple {32764#(<= ~counter~0 3)} ~cond := #in~cond; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,389 INFO L290 TraceCheckUtils]: 72: Hoare triple {32764#(<= ~counter~0 3)} assume !(0 == ~cond); {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,389 INFO L290 TraceCheckUtils]: 73: Hoare triple {32764#(<= ~counter~0 3)} assume true; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,390 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32764#(<= ~counter~0 3)} {32764#(<= ~counter~0 3)} #92#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {32764#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,390 INFO L290 TraceCheckUtils]: 76: Hoare triple {32764#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,391 INFO L290 TraceCheckUtils]: 77: Hoare triple {32834#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,409 INFO L272 TraceCheckUtils]: 78: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,410 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #86#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,411 INFO L272 TraceCheckUtils]: 83: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,411 INFO L290 TraceCheckUtils]: 84: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,411 INFO L290 TraceCheckUtils]: 85: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,411 INFO L290 TraceCheckUtils]: 86: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,412 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #88#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,412 INFO L272 TraceCheckUtils]: 88: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,412 INFO L290 TraceCheckUtils]: 89: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,412 INFO L290 TraceCheckUtils]: 90: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,413 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #90#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,413 INFO L272 TraceCheckUtils]: 93: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,414 INFO L290 TraceCheckUtils]: 94: Hoare triple {32834#(<= ~counter~0 4)} ~cond := #in~cond; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,414 INFO L290 TraceCheckUtils]: 95: Hoare triple {32834#(<= ~counter~0 4)} assume !(0 == ~cond); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,414 INFO L290 TraceCheckUtils]: 96: Hoare triple {32834#(<= ~counter~0 4)} assume true; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,414 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32834#(<= ~counter~0 4)} {32834#(<= ~counter~0 4)} #92#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,415 INFO L290 TraceCheckUtils]: 98: Hoare triple {32834#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,415 INFO L290 TraceCheckUtils]: 99: Hoare triple {32834#(<= ~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; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,415 INFO L290 TraceCheckUtils]: 100: Hoare triple {32834#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32907#(<= |main_#t~post6| 4)} is VALID [2022-04-28 05:42:46,416 INFO L290 TraceCheckUtils]: 101: Hoare triple {32907#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {32598#false} is VALID [2022-04-28 05:42:46,416 INFO L272 TraceCheckUtils]: 102: Hoare triple {32598#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32598#false} is VALID [2022-04-28 05:42:46,416 INFO L290 TraceCheckUtils]: 103: Hoare triple {32598#false} ~cond := #in~cond; {32598#false} is VALID [2022-04-28 05:42:46,416 INFO L290 TraceCheckUtils]: 104: Hoare triple {32598#false} assume 0 == ~cond; {32598#false} is VALID [2022-04-28 05:42:46,416 INFO L290 TraceCheckUtils]: 105: Hoare triple {32598#false} assume !false; {32598#false} is VALID [2022-04-28 05:42:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 215 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-28 05:42:46,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:42:46,667 INFO L290 TraceCheckUtils]: 105: Hoare triple {32598#false} assume !false; {32598#false} is VALID [2022-04-28 05:42:46,667 INFO L290 TraceCheckUtils]: 104: Hoare triple {32598#false} assume 0 == ~cond; {32598#false} is VALID [2022-04-28 05:42:46,667 INFO L290 TraceCheckUtils]: 103: Hoare triple {32598#false} ~cond := #in~cond; {32598#false} is VALID [2022-04-28 05:42:46,668 INFO L272 TraceCheckUtils]: 102: Hoare triple {32598#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32598#false} is VALID [2022-04-28 05:42:46,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {32907#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {32598#false} is VALID [2022-04-28 05:42:46,668 INFO L290 TraceCheckUtils]: 100: Hoare triple {32834#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32907#(<= |main_#t~post6| 4)} is VALID [2022-04-28 05:42:46,668 INFO L290 TraceCheckUtils]: 99: Hoare triple {32834#(<= ~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; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,669 INFO L290 TraceCheckUtils]: 98: Hoare triple {32834#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,669 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #92#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,669 INFO L290 TraceCheckUtils]: 96: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,669 INFO L290 TraceCheckUtils]: 95: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,669 INFO L272 TraceCheckUtils]: 93: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #90#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,670 INFO L290 TraceCheckUtils]: 91: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L290 TraceCheckUtils]: 90: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L290 TraceCheckUtils]: 89: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L272 TraceCheckUtils]: 88: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #88#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,670 INFO L290 TraceCheckUtils]: 86: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L290 TraceCheckUtils]: 85: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L290 TraceCheckUtils]: 84: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,670 INFO L272 TraceCheckUtils]: 83: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,671 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32597#true} {32834#(<= ~counter~0 4)} #86#return; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,671 INFO L290 TraceCheckUtils]: 81: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,671 INFO L290 TraceCheckUtils]: 80: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,671 INFO L290 TraceCheckUtils]: 79: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,671 INFO L272 TraceCheckUtils]: 78: Hoare triple {32834#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {32834#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {32764#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32834#(<= ~counter~0 4)} is VALID [2022-04-28 05:42:46,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {32764#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,673 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #92#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,673 INFO L290 TraceCheckUtils]: 73: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,673 INFO L272 TraceCheckUtils]: 70: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,673 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #90#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,679 INFO L290 TraceCheckUtils]: 68: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,679 INFO L290 TraceCheckUtils]: 67: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,681 INFO L272 TraceCheckUtils]: 65: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,681 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #88#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,682 INFO L272 TraceCheckUtils]: 60: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,682 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32597#true} {32764#(<= ~counter~0 3)} #86#return; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,682 INFO L290 TraceCheckUtils]: 56: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,682 INFO L272 TraceCheckUtils]: 55: Hoare triple {32764#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {32764#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {32694#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32764#(<= ~counter~0 3)} is VALID [2022-04-28 05:42:46,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {32694#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,684 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #92#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,684 INFO L290 TraceCheckUtils]: 49: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,684 INFO L290 TraceCheckUtils]: 48: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,684 INFO L272 TraceCheckUtils]: 47: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,685 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #90#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,685 INFO L272 TraceCheckUtils]: 42: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,686 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #88#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,687 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32597#true} {32694#(<= ~counter~0 2)} #86#return; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,687 INFO L272 TraceCheckUtils]: 32: Hoare triple {32694#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {32694#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {32684#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32694#(<= ~counter~0 2)} is VALID [2022-04-28 05:42:46,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {32684#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32684#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:46,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {32684#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:46,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {32605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32684#(<= ~counter~0 1)} is VALID [2022-04-28 05:42:46,689 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #84#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,690 INFO L272 TraceCheckUtils]: 22: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,690 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #82#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,690 INFO L272 TraceCheckUtils]: 17: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {32605#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,691 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #80#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32597#true} {32605#(<= ~counter~0 0)} #78#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {32597#true} assume true; {32597#true} is VALID [2022-04-28 05:42:46,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {32597#true} assume !(0 == ~cond); {32597#true} is VALID [2022-04-28 05:42:46,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {32597#true} ~cond := #in~cond; {32597#true} is VALID [2022-04-28 05:42:46,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {32605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32597#true} is VALID [2022-04-28 05:42:46,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {32605#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {32605#(<= ~counter~0 0)} call #t~ret8 := main(); {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32605#(<= ~counter~0 0)} {32597#true} #98#return; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {32605#(<= ~counter~0 0)} assume true; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {32597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {32605#(<= ~counter~0 0)} is VALID [2022-04-28 05:42:46,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {32597#true} call ULTIMATE.init(); {32597#true} is VALID [2022-04-28 05:42:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-28 05:42:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:42:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863290018] [2022-04-28 05:42:46,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:42:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684600878] [2022-04-28 05:42:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684600878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:42:46,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:42:46,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:42:46,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:42:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932563829] [2022-04-28 05:42:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932563829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:42:46,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:42:46,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:42:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464369498] [2022-04-28 05:42:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:42:46,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-28 05:42:46,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:42:46,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:46,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:46,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:42:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:46,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:42:46,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:42:46,751 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:47,488 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-28 05:42:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:42:47,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-28 05:42:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:42:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 05:42:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 05:42:47,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 05:42:47,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:47,576 INFO L225 Difference]: With dead ends: 349 [2022-04-28 05:42:47,576 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 05:42:47,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:42:47,577 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:42:47,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 177 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:42:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 05:42:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-28 05:42:48,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:42:48,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:48,126 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:48,126 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:48,132 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-28 05:42:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 05:42:48,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:48,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:48,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-28 05:42:48,133 INFO L87 Difference]: Start difference. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-28 05:42:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:42:48,139 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-28 05:42:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 05:42:48,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:42:48,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:42:48,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:42:48,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:42:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 05:42:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-28 05:42:48,146 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-28 05:42:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:42:48,146 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-28 05:42:48,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 05:42:48,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-28 05:42:48,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:42:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-28 05:42:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 05:42:48,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:42:48,775 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:42:48,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 05:42:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 05:42:48,975 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:42:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:42:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-28 05:42:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:42:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635606896] [2022-04-28 05:42:48,976 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:42:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-28 05:42:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:42:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187132968] [2022-04-28 05:42:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:42:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:42:48,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:42:48,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554441228] [2022-04-28 05:42:48,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:42:48,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:42:48,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:42:48,995 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:42:49,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 05:42:49,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:42:49,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:42:49,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 05:42:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:42:49,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:42:49,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {35312#true} call ULTIMATE.init(); {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {35312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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; {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35312#true} {35312#true} #98#return; {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {35312#true} call #t~ret8 := main(); {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {35312#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {35312#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35312#true} {35312#true} #78#return; {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L272 TraceCheckUtils]: 11: Hoare triple {35312#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35312#true} {35312#true} #80#return; {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {35312#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,718 INFO L272 TraceCheckUtils]: 17: Hoare triple {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,719 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35312#true} {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,719 INFO L272 TraceCheckUtils]: 22: Hoare triple {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,720 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35312#true} {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {35365#(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; {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {35365#(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 < 5);havoc #t~post6; {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {35365#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,721 INFO L272 TraceCheckUtils]: 32: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,722 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35312#true} {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,722 INFO L272 TraceCheckUtils]: 37: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,722 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35312#true} {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,722 INFO L272 TraceCheckUtils]: 42: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,723 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35312#true} {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,723 INFO L272 TraceCheckUtils]: 47: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,724 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35312#true} {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {35405#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,725 INFO L272 TraceCheckUtils]: 55: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35312#true} {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,726 INFO L272 TraceCheckUtils]: 60: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,727 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35312#true} {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #88#return; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,727 INFO L272 TraceCheckUtils]: 65: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,727 INFO L290 TraceCheckUtils]: 66: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,727 INFO L290 TraceCheckUtils]: 67: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,727 INFO L290 TraceCheckUtils]: 68: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,727 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35312#true} {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #90#return; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,727 INFO L272 TraceCheckUtils]: 70: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,728 INFO L290 TraceCheckUtils]: 71: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,728 INFO L290 TraceCheckUtils]: 72: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,728 INFO L290 TraceCheckUtils]: 73: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,728 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35312#true} {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #92#return; {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,729 INFO L290 TraceCheckUtils]: 75: Hoare triple {35475#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,729 INFO L290 TraceCheckUtils]: 76: Hoare triple {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,730 INFO L290 TraceCheckUtils]: 77: Hoare triple {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,730 INFO L272 TraceCheckUtils]: 78: Hoare triple {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {35312#true} ~cond := #in~cond; {35558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:49,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {35558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:49,730 INFO L290 TraceCheckUtils]: 81: Hoare triple {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:42:49,731 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35562#(not (= |__VERIFIER_assert_#in~cond| 0))} {35545#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,731 INFO L272 TraceCheckUtils]: 83: Hoare triple {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,731 INFO L290 TraceCheckUtils]: 84: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,731 INFO L290 TraceCheckUtils]: 85: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,732 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35312#true} {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #88#return; {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,732 INFO L272 TraceCheckUtils]: 88: Hoare triple {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,732 INFO L290 TraceCheckUtils]: 89: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,732 INFO L290 TraceCheckUtils]: 90: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,732 INFO L290 TraceCheckUtils]: 91: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,732 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {35312#true} {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #90#return; {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,732 INFO L272 TraceCheckUtils]: 93: Hoare triple {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {35312#true} is VALID [2022-04-28 05:42:49,733 INFO L290 TraceCheckUtils]: 94: Hoare triple {35312#true} ~cond := #in~cond; {35312#true} is VALID [2022-04-28 05:42:49,733 INFO L290 TraceCheckUtils]: 95: Hoare triple {35312#true} assume !(0 == ~cond); {35312#true} is VALID [2022-04-28 05:42:49,733 INFO L290 TraceCheckUtils]: 96: Hoare triple {35312#true} assume true; {35312#true} is VALID [2022-04-28 05:42:49,733 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {35312#true} {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #92#return; {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,733 INFO L290 TraceCheckUtils]: 98: Hoare triple {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:42:49,735 INFO L290 TraceCheckUtils]: 99: Hoare triple {35569#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35621#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:42:49,735 INFO L290 TraceCheckUtils]: 100: Hoare triple {35621#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35621#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:42:49,736 INFO L290 TraceCheckUtils]: 101: Hoare triple {35621#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {35621#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-28 05:42:49,736 INFO L290 TraceCheckUtils]: 102: Hoare triple {35621#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !(0 != ~b~0); {35631#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} is VALID [2022-04-28 05:42:49,736 INFO L272 TraceCheckUtils]: 103: Hoare triple {35631#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {35635#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:42:49,737 INFO L290 TraceCheckUtils]: 104: Hoare triple {35635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:42:49,737 INFO L290 TraceCheckUtils]: 105: Hoare triple {35639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35313#false} is VALID [2022-04-28 05:42:49,737 INFO L290 TraceCheckUtils]: 106: Hoare triple {35313#false} assume !false; {35313#false} is VALID [2022-04-28 05:42:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 47 proven. 34 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-04-28 05:42:49,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:00,588 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:43:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187132968] [2022-04-28 05:43:00,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554441228] [2022-04-28 05:43:00,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554441228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:43:00,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:43:00,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 05:43:00,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:00,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635606896] [2022-04-28 05:43:00,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635606896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:00,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:00,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:43:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380191387] [2022-04-28 05:43:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:00,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-28 05:43:00,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:00,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:00,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:00,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:43:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:43:00,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:43:00,791 INFO L87 Difference]: Start difference. First operand 342 states and 445 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:03,188 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-28 05:43:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:43:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-28 05:43:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-28 05:43:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-28 05:43:03,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-28 05:43:03,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:03,318 INFO L225 Difference]: With dead ends: 369 [2022-04-28 05:43:03,318 INFO L226 Difference]: Without dead ends: 366 [2022-04-28 05:43:03,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:43:03,318 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:03,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 296 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 05:43:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-28 05:43:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-28 05:43:03,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:03,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:03,864 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:03,864 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:03,879 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-28 05:43:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-28 05:43:03,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:03,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:03,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-28 05:43:03,880 INFO L87 Difference]: Start difference. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-28 05:43:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:03,886 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-28 05:43:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-28 05:43:03,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:03,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:03,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:03,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-28 05:43:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-28 05:43:03,895 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-28 05:43:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:03,895 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-28 05:43:03,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-28 05:43:03,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-28 05:43:04,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-28 05:43:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 05:43:04,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:04,504 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:04,521 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:43:04,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 05:43:04,705 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-28 05:43:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:04,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208749753] [2022-04-28 05:43:04,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-28 05:43:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:04,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164878950] [2022-04-28 05:43:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:04,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:04,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [516754866] [2022-04-28 05:43:04,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:43:04,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:04,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:04,742 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:43:04,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 05:43:04,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:43:04,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 05:43:04,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 05:43:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 05:43:04,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 05:43:04,920 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 05:43:04,920 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 05:43:04,922 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 05:43:04,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 05:43:05,130 INFO L356 BasicCegarLoop]: Path program histogram: [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 05:43:05,132 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 05:43:05,153 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 05:43:05,154 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 05:43:05,155 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 05:43:05,155 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:43:05,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 05:43:05 BoogieIcfgContainer [2022-04-28 05:43:05,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 05:43:05,160 INFO L158 Benchmark]: Toolchain (without parser) took 328469.80ms. Allocated memory was 178.3MB in the beginning and 306.2MB in the end (delta: 127.9MB). Free memory was 122.7MB in the beginning and 231.1MB in the end (delta: -108.4MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-04-28 05:43:05,161 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory was 138.7MB in the beginning and 138.6MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 05:43:05,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.48ms. Allocated memory was 178.3MB in the beginning and 254.8MB in the end (delta: 76.5MB). Free memory was 122.5MB in the beginning and 229.6MB in the end (delta: -107.0MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 05:43:05,161 INFO L158 Benchmark]: Boogie Preprocessor took 47.51ms. Allocated memory is still 254.8MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 05:43:05,161 INFO L158 Benchmark]: RCFGBuilder took 301.60ms. Allocated memory is still 254.8MB. Free memory was 228.0MB in the beginning and 213.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 05:43:05,161 INFO L158 Benchmark]: TraceAbstraction took 327930.35ms. Allocated memory was 254.8MB in the beginning and 306.2MB in the end (delta: 51.4MB). Free memory was 213.3MB in the beginning and 231.1MB in the end (delta: -17.8MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-04-28 05:43:05,162 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.15ms. Allocated memory is still 178.3MB. Free memory was 138.7MB in the beginning and 138.6MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.48ms. Allocated memory was 178.3MB in the beginning and 254.8MB in the end (delta: 76.5MB). Free memory was 122.5MB in the beginning and 229.6MB in the end (delta: -107.0MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.51ms. Allocated memory is still 254.8MB. Free memory was 229.6MB in the beginning and 228.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 301.60ms. Allocated memory is still 254.8MB. Free memory was 228.0MB in the beginning and 213.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 327930.35ms. Allocated memory was 254.8MB in the beginning and 306.2MB in the end (delta: 51.4MB). Free memory was 213.3MB in the beginning and 231.1MB in the end (delta: -17.8MB). Peak memory consumption was 33.6MB. 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, c, k, xy, yy; [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 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y [L37] CALL assume_abort_if_not(xy < 2147483647) [L8] COND FALSE !(!cond) [L37] RET assume_abort_if_not(xy < 2147483647) [L38] CALL assume_abort_if_not(yy < 2147483647) [L8] COND FALSE !(!cond) [L38] RET assume_abort_if_not(yy < 2147483647) [L40] EXPR counter++ [L40] COND TRUE counter++<5 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(a == k * b + c) [L48] CALL __VERIFIER_assert(a == y*r + x*p) [L11] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(a == y*r + x*p) [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(b == x * q + y * s) [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND TRUE counter++<5 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(a == k * b + c) [L48] CALL __VERIFIER_assert(a == y*r + x*p) [L11] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(a == y*r + x*p) [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(b == x * q + y * s) [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 [L46] EXPR counter++ [L46] COND TRUE counter++<5 [L47] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L47] RET __VERIFIER_assert(a == k * b + c) [L48] CALL __VERIFIER_assert(a == y*r + x*p) [L11] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(a == y*r + x*p) [L49] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(b == x * q + y * s) [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND FALSE !(counter++<5) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) [L11] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 327.9s, OverallIterations: 27, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 39.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 712 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 4873 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3626 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4008 IncrementalHoareTripleChecker+Invalid, 4496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 1247 mSDtfsCounter, 4008 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3065 GetRequests, 2777 SyntacticMatches, 26 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=26, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 120 StatesRemovedByMinimization, 19 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:43:05,206 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...