/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:56:43,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:56:43,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:56:43,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:56:43,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:56:43,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:56:43,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:56:43,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:56:43,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:56:43,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:56:43,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:56:43,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:56:43,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:56:43,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:56:43,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:56:43,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:56:43,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:56:43,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:56:43,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:56:43,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:56:43,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:56:43,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:56:43,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:56:43,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:56:43,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:56:43,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:56:43,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:56:43,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:56:43,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:56:43,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:56:43,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:56:43,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:56:43,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:56:43,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:56:43,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:56:43,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:56:43,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:56:43,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:56:43,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:56:43,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:56:43,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:56:43,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:56:43,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 13:56:43,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:56:43,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:56:43,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:56:43,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:56:43,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:56:43,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:56:43,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:56:43,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:56:43,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:56:43,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:56:43,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:56:43,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:56:43,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:56:43,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:56:43,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:56:43,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:56:43,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:56:43,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:56:43,223 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:56:43,223 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:56:43,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:56:43,223 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:56:43,223 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 13:56:43,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:56:43,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:56:43,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:56:43,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:56:43,433 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:56:43,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-28 13:56:43,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa9e46f9/37b4ab6d0c8f4b1180a830716f91ea40/FLAGbfe41d910 [2022-04-28 13:56:43,841 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:56:43,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-28 13:56:43,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa9e46f9/37b4ab6d0c8f4b1180a830716f91ea40/FLAGbfe41d910 [2022-04-28 13:56:44,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa9e46f9/37b4ab6d0c8f4b1180a830716f91ea40 [2022-04-28 13:56:44,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:56:44,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:56:44,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:56:44,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:56:44,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:56:44,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b65583f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44, skipping insertion in model container [2022-04-28 13:56:44,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:56:44,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:56:44,518 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/mannadiv_unwindbound20.c[573,586] [2022-04-28 13:56:44,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:56:44,547 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:56:44,563 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/mannadiv_unwindbound20.c[573,586] [2022-04-28 13:56:44,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:56:44,593 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:56:44,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44 WrapperNode [2022-04-28 13:56:44,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:56:44,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:56:44,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:56:44,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:56:44,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:56:44,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:56:44,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:56:44,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:56:44,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (1/1) ... [2022-04-28 13:56:44,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:56:44,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:44,671 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 13:56:44,687 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 13:56:44,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:56:44,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:56:44,707 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:56:44,707 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:56:44,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:56:44,707 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:56:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:56:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:56:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:56:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:56:44,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:56:44,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:56:44,754 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:56:44,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:56:44,883 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:56:44,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:56:44,889 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 13:56:44,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:56:44 BoogieIcfgContainer [2022-04-28 13:56:44,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:56:44,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:56:44,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:56:44,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:56:44,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:56:44" (1/3) ... [2022-04-28 13:56:44,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f50a3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:56:44, skipping insertion in model container [2022-04-28 13:56:44,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:44" (2/3) ... [2022-04-28 13:56:44,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f50a3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:56:44, skipping insertion in model container [2022-04-28 13:56:44,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:56:44" (3/3) ... [2022-04-28 13:56:44,896 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2022-04-28 13:56:44,906 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:56:44,906 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:56:44,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:56:44,945 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@559ca34, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19e5ac50 [2022-04-28 13:56:44,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:56:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:56:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 13:56:44,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:44,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:56:44,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-28 13:56:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:44,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10077790] [2022-04-28 13:56:44,978 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-28 13:56:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:44,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653286839] [2022-04-28 13:56:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:56:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:45,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(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; {33#true} is VALID [2022-04-28 13:56:45,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 13:56:45,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 13:56:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 13:56:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:45,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:56:45,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:56:45,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:56:45,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 13:56:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 13:56:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:45,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:56:45,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:56:45,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:56:45,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 13:56:45,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:56:45,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(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; {33#true} is VALID [2022-04-28 13:56:45,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 13:56:45,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 13:56:45,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 13:56:45,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-28 13:56:45,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-28 13:56:45,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:56:45,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:56:45,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:56:45,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 13:56:45,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-28 13:56:45,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:56:45,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:56:45,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:56:45,233 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 13:56:45,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-28 13:56:45,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 13:56:45,234 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-28 13:56:45,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 13:56:45,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 13:56:45,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 13:56:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:45,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653286839] [2022-04-28 13:56:45,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653286839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:45,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:45,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:56:45,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10077790] [2022-04-28 13:56:45,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10077790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:45,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:45,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:56:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600128689] [2022-04-28 13:56:45,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:45,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:56:45,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:45,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:45,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:45,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:56:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:56:45,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:56:45,309 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:45,469 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-28 13:56:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:56:45,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:56:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 13:56:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 13:56:45,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-28 13:56:45,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:45,561 INFO L225 Difference]: With dead ends: 54 [2022-04-28 13:56:45,562 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 13:56:45,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:56:45,567 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:45,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:56:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 13:56:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 13:56:45,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:56:45,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:45,594 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:45,595 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:45,598 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 13:56:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 13:56:45,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:45,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:45,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 13:56:45,600 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 13:56:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:45,603 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 13:56:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 13:56:45,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:45,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:45,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:56:45,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:56:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 13:56:45,609 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 13:56:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:56:45,610 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 13:56:45,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:45,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 13:56:45,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 13:56:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 13:56:45,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:45,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:56:45,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:56:45,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:45,645 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-28 13:56:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:45,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674684935] [2022-04-28 13:56:45,647 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-28 13:56:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:45,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863223872] [2022-04-28 13:56:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:45,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:56:45,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702074512] [2022-04-28 13:56:45,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:56:45,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:56:45,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:45,679 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 13:56:45,685 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 13:56:45,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:56:45,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:56:45,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 13:56:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:45,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:56:45,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2022-04-28 13:56:45,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(<= ~counter~0 0)} {259#true} #67#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(<= ~counter~0 0)} call #t~ret7 := main(); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,952 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #59#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,955 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,959 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #61#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:45,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {316#(<= |main_#t~post6| 0)} is VALID [2022-04-28 13:56:45,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {316#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {260#false} is VALID [2022-04-28 13:56:45,965 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {260#false} is VALID [2022-04-28 13:56:45,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2022-04-28 13:56:45,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#false} assume 0 == ~cond; {260#false} is VALID [2022-04-28 13:56:45,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-04-28 13:56:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:45,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:56:45,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:45,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863223872] [2022-04-28 13:56:45,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:56:45,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702074512] [2022-04-28 13:56:45,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702074512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:45,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:45,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:56:45,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:45,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [674684935] [2022-04-28 13:56:45,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [674684935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:45,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:45,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:56:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488768205] [2022-04-28 13:56:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 13:56:45,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:45,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:45,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:56:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:45,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:56:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:56:45,991 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:46,056 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 13:56:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:56:46,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 13:56:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 13:56:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 13:56:46,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 13:56:46,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:46,102 INFO L225 Difference]: With dead ends: 34 [2022-04-28 13:56:46,102 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 13:56:46,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:56:46,105 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:46,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:56:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 13:56:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 13:56:46,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:56:46,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:46,130 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:46,131 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:46,137 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 13:56:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:56:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:46,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:46,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 13:56:46,141 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 13:56:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:46,144 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 13:56:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:56:46,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:46,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:46,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:56:46,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:56:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 13:56:46,149 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 13:56:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:56:46,149 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 13:56:46,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:56:46,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 13:56:46,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:56:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 13:56:46,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:46,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:56:46,216 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 13:56:46,399 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 13:56:46,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-28 13:56:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:46,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1611618798] [2022-04-28 13:56:46,401 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-28 13:56:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723539980] [2022-04-28 13:56:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:46,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:56:46,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [69724266] [2022-04-28 13:56:46,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:56:46,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:56:46,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:46,420 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 13:56:46,433 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 13:56:46,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:56:46,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:56:46,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:56:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:46,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:56:49,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 13:56:49,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {507#true} is VALID [2022-04-28 13:56:49,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:56:49,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #67#return; {507#true} is VALID [2022-04-28 13:56:49,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2022-04-28 13:56:49,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {507#true} is VALID [2022-04-28 13:56:49,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {507#true} is VALID [2022-04-28 13:56:49,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 13:56:49,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 13:56:49,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:56:49,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #59#return; {507#true} is VALID [2022-04-28 13:56:49,124 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {507#true} is VALID [2022-04-28 13:56:49,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 13:56:49,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 13:56:49,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:56:49,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 13:56:49,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:56:49,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:56:49,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 20);havoc #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:56:49,141 INFO L272 TraceCheckUtils]: 19: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:56:49,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:56:49,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 13:56:49,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 13:56:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:49,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:56:49,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:49,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723539980] [2022-04-28 13:56:49,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:56:49,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69724266] [2022-04-28 13:56:49,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69724266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:49,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:49,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:56:49,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:49,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1611618798] [2022-04-28 13:56:49,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1611618798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:49,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:49,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:56:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968891889] [2022-04-28 13:56:49,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 13:56:49,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:49,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:56:49,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:49,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:56:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:49,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:56:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:56:49,164 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:56:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:49,338 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 13:56:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:56:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 13:56:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:56:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 13:56:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:56:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 13:56:49,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-28 13:56:49,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:49,401 INFO L225 Difference]: With dead ends: 37 [2022-04-28 13:56:49,401 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 13:56:49,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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 13:56:49,402 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:49,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:56:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 13:56:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 13:56:49,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:56:49,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:49,424 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:49,424 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:49,429 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 13:56:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 13:56:49,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:49,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:49,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 13:56:49,436 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 13:56:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:49,441 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 13:56:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 13:56:49,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:49,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:49,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:56:49,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:56:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 13:56:49,448 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 13:56:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:56:49,449 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 13:56:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:56:49,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 13:56:49,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 13:56:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 13:56:49,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:49,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:56:49,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 13:56:49,707 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 13:56:49,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-28 13:56:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:49,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409246928] [2022-04-28 13:56:49,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-28 13:56:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:49,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068751465] [2022-04-28 13:56:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:49,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:56:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947494527] [2022-04-28 13:56:49,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:56:49,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:56:49,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:49,738 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 13:56:49,738 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 13:56:49,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:56:49,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:56:49,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 13:56:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:49,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:56:49,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 13:56:49,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 13:56:49,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:56:49,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 13:56:49,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 13:56:49,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 13:56:49,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:56:49,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:56:49,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:56:49,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:56:49,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 13:56:49,972 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:56:49,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:56:49,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:56:49,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:56:49,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 13:56:49,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 13:56:49,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 13:56:49,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 20);havoc #t~post6; {790#true} is VALID [2022-04-28 13:56:49,974 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:56:49,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:56:49,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:56:49,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:56:49,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:56:49,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:56:49,980 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:56:49,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:56:49,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 13:56:49,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 13:56:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:49,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:56:56,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 13:56:56,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 13:56:56,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:56:56,352 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:56:56,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:56:56,353 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-28 13:56:56,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:56:56,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:56:56,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:56:56,355 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:56:56,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 20);havoc #t~post6; {790#true} is VALID [2022-04-28 13:56:56,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 13:56:56,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 13:56:56,356 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 13:56:56,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:56:56,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:56:56,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:56:56,356 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:56:56,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 13:56:56,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:56:56,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:56:56,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:56:56,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:56:56,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 13:56:56,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 13:56:56,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 13:56:56,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:56:56,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 13:56:56,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 13:56:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:56,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068751465] [2022-04-28 13:56:56,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:56:56,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947494527] [2022-04-28 13:56:56,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947494527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:56:56,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:56:56,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 13:56:56,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:56,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409246928] [2022-04-28 13:56:56,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409246928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:56,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:56,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:56:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104346017] [2022-04-28 13:56:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:56,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 13:56:56,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:56,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:56:56,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:56,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:56:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:56,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:56:56,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:56:56,383 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:56:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:56,634 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 13:56:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:56:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 13:56:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:56:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 13:56:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:56:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 13:56:56,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 13:56:56,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:56,671 INFO L225 Difference]: With dead ends: 39 [2022-04-28 13:56:56,671 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 13:56:56,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 13:56:56,672 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:56,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:56:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 13:56:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 13:56:56,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:56:56,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:56,691 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:56,691 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:56,693 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 13:56:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 13:56:56,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:56,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:56,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 13:56:56,694 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 13:56:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:56,695 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 13:56:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 13:56:56,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:56,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:56,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:56:56,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:56:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:56:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 13:56:56,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 13:56:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:56:56,698 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 13:56:56,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:56:56,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 13:56:56,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 13:56:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 13:56:56,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:56,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:56:56,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 13:56:56,954 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 13:56:56,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-28 13:56:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:56,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797756274] [2022-04-28 13:56:56,956 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-28 13:56:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:56,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811303049] [2022-04-28 13:56:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:56,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:56:56,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158967272] [2022-04-28 13:56:56,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:56:56,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:56:56,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:57,000 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 13:56:57,022 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 13:56:57,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:56:57,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:56:57,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:56:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:57,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:56:57,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 13:56:57,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#(<= ~counter~0 0)} {1183#true} #67#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#(<= ~counter~0 0)} call #t~ret7 := main(); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #59#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,228 INFO L272 TraceCheckUtils]: 11: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #61#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:57,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,231 INFO L272 TraceCheckUtils]: 19: Hoare triple {1240#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(<= ~counter~0 1)} ~cond := #in~cond; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {1240#(<= ~counter~0 1)} assume !(0 == ~cond); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {1240#(<= ~counter~0 1)} assume true; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,233 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1240#(<= ~counter~0 1)} {1240#(<= ~counter~0 1)} #63#return; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {1240#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {1240#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:57,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {1240#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1268#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:56:57,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1184#false} is VALID [2022-04-28 13:56:57,234 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 13:56:57,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 13:56:57,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 13:56:57,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 13:56:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:57,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:56:57,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 13:56:57,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 13:56:57,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 13:56:57,430 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 13:56:57,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1184#false} is VALID [2022-04-28 13:56:57,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {1300#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1296#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:56:57,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1300#(< ~counter~0 20)} is VALID [2022-04-28 13:56:57,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(< ~counter~0 20)} assume !!(0 != ~y3~0); {1300#(< ~counter~0 20)} is VALID [2022-04-28 13:56:57,433 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1183#true} {1300#(< ~counter~0 20)} #63#return; {1300#(< ~counter~0 20)} is VALID [2022-04-28 13:56:57,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:56:57,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:56:57,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:56:57,433 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:56:57,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1300#(< ~counter~0 20)} is VALID [2022-04-28 13:56:57,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1300#(< ~counter~0 20)} is VALID [2022-04-28 13:56:57,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {1328#(< ~counter~0 19)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#true} {1328#(< ~counter~0 19)} #61#return; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:56:57,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:56:57,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:56:57,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {1328#(< ~counter~0 19)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:56:57,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1328#(< ~counter~0 19)} #59#return; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:56:57,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:56:57,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:56:57,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {1328#(< ~counter~0 19)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:56:57,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#(< ~counter~0 19)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#(< ~counter~0 19)} call #t~ret7 := main(); {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#(< ~counter~0 19)} {1183#true} #67#return; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#(< ~counter~0 19)} assume true; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1328#(< ~counter~0 19)} is VALID [2022-04-28 13:56:57,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 13:56:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:57,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811303049] [2022-04-28 13:56:57,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:56:57,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158967272] [2022-04-28 13:56:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158967272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:56:57,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:56:57,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 13:56:57,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:57,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797756274] [2022-04-28 13:56:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797756274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:57,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:57,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:56:57,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676498554] [2022-04-28 13:56:57,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:57,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 13:56:57,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:57,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:56:57,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:57,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:56:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:57,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:56:57,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:56:57,473 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:56:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:57,572 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 13:56:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:56:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 13:56:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:56:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 13:56:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:56:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 13:56:57,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 13:56:57,610 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 13:56:57,611 INFO L225 Difference]: With dead ends: 43 [2022-04-28 13:56:57,611 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 13:56:57,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:56:57,612 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:57,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:56:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 13:56:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 13:56:57,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:56:57,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:57,639 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:57,639 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:57,641 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 13:56:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:56:57,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:57,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:57,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 13:56:57,641 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 13:56:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:57,643 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 13:56:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:56:57,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:57,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:57,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:56:57,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:56:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:56:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 13:56:57,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 13:56:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:56:57,645 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 13:56:57,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:56:57,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 13:56:57,697 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 13:56:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:56:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 13:56:57,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:57,698 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:56:57,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 13:56:57,907 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 13:56:57,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-28 13:56:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423757173] [2022-04-28 13:56:57,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-28 13:56:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:57,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198234530] [2022-04-28 13:56:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:57,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:56:57,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528625971] [2022-04-28 13:56:57,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:56:57,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:56:57,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:57,930 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 13:56:57,954 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 13:56:57,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:56:57,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:56:57,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:56:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:57,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:56:58,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 13:56:58,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#(<= ~counter~0 0)} {1622#true} #67#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(<= ~counter~0 0)} call #t~ret7 := main(); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #59#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,184 INFO L272 TraceCheckUtils]: 11: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,186 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #61#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:58,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,187 INFO L272 TraceCheckUtils]: 19: Hoare triple {1679#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {1679#(<= ~counter~0 1)} ~cond := #in~cond; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {1679#(<= ~counter~0 1)} assume !(0 == ~cond); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {1679#(<= ~counter~0 1)} assume true; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,189 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1679#(<= ~counter~0 1)} {1679#(<= ~counter~0 1)} #63#return; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {1679#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {1679#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:58,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {1679#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {1707#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,191 INFO L272 TraceCheckUtils]: 28: Hoare triple {1707#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {1707#(<= ~counter~0 2)} ~cond := #in~cond; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {1707#(<= ~counter~0 2)} assume !(0 == ~cond); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,193 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1707#(<= ~counter~0 2)} {1707#(<= ~counter~0 2)} #63#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {1707#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {1707#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:58,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1735#(<= |main_#t~post6| 2)} is VALID [2022-04-28 13:56:58,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {1735#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1623#false} is VALID [2022-04-28 13:56:58,194 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 13:56:58,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 13:56:58,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 13:56:58,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 13:56:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:58,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:56:58,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 13:56:58,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 13:56:58,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 13:56:58,438 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 13:56:58,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {1763#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1623#false} is VALID [2022-04-28 13:56:58,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {1767#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1763#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:56:58,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1767#(< ~counter~0 20)} is VALID [2022-04-28 13:56:58,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(< ~counter~0 20)} assume !!(0 != ~y3~0); {1767#(< ~counter~0 20)} is VALID [2022-04-28 13:56:58,441 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1622#true} {1767#(< ~counter~0 20)} #63#return; {1767#(< ~counter~0 20)} is VALID [2022-04-28 13:56:58,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:56:58,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:56:58,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:56:58,442 INFO L272 TraceCheckUtils]: 28: Hoare triple {1767#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:56:58,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1767#(< ~counter~0 20)} is VALID [2022-04-28 13:56:58,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(< ~counter~0 20)} is VALID [2022-04-28 13:56:58,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {1795#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1795#(< ~counter~0 19)} is VALID [2022-04-28 13:56:58,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1795#(< ~counter~0 19)} assume !!(0 != ~y3~0); {1795#(< ~counter~0 19)} is VALID [2022-04-28 13:56:58,449 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1622#true} {1795#(< ~counter~0 19)} #63#return; {1795#(< ~counter~0 19)} is VALID [2022-04-28 13:56:58,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:56:58,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:56:58,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:56:58,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {1795#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:56:58,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {1795#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {1795#(< ~counter~0 19)} is VALID [2022-04-28 13:56:58,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< ~counter~0 19)} is VALID [2022-04-28 13:56:58,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {1823#(< ~counter~0 18)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,452 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1622#true} {1823#(< ~counter~0 18)} #61#return; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:56:58,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:56:58,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:56:58,453 INFO L272 TraceCheckUtils]: 11: Hoare triple {1823#(< ~counter~0 18)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:56:58,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1622#true} {1823#(< ~counter~0 18)} #59#return; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:56:58,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:56:58,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:56:58,454 INFO L272 TraceCheckUtils]: 6: Hoare triple {1823#(< ~counter~0 18)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:56:58,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1823#(< ~counter~0 18)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {1823#(< ~counter~0 18)} call #t~ret7 := main(); {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1823#(< ~counter~0 18)} {1622#true} #67#return; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1823#(< ~counter~0 18)} assume true; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1823#(< ~counter~0 18)} is VALID [2022-04-28 13:56:58,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 13:56:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 13:56:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:58,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198234530] [2022-04-28 13:56:58,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:56:58,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528625971] [2022-04-28 13:56:58,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528625971] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:56:58,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:56:58,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 13:56:58,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:58,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423757173] [2022-04-28 13:56:58,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423757173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:58,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:58,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:56:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035918828] [2022-04-28 13:56:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 13:56:58,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:58,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:56:58,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:58,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:56:58,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:56:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:56:58,489 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:56:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:58,639 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 13:56:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:56:58,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 13:56:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:56:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 13:56:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:56:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 13:56:58,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 13:56:58,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:58,687 INFO L225 Difference]: With dead ends: 52 [2022-04-28 13:56:58,687 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 13:56:58,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:56:58,688 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:58,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:56:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 13:56:58,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 13:56:58,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:56:58,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:56:58,728 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:56:58,728 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:56:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:58,729 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 13:56:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:56:58,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:58,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:58,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 13:56:58,730 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 13:56:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:58,732 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 13:56:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:56:58,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:56:58,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:56:58,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:56:58,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:56:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:56:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 13:56:58,734 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-28 13:56:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:56:58,734 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 13:56:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:56:58,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 13:56:58,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:56:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 13:56:58,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:56:58,792 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-04-28 13:56:58,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 13:56:58,992 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 13:56:58,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:56:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:56:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-28 13:56:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:58,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758260425] [2022-04-28 13:56:58,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:56:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-28 13:56:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:56:58,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546017134] [2022-04-28 13:56:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:56:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:56:59,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:56:59,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492144013] [2022-04-28 13:56:59,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:56:59,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:56:59,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:56:59,016 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 13:56:59,017 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 13:56:59,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 13:56:59,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:56:59,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:56:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:56:59,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:56:59,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-28 13:56:59,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2181#(<= ~counter~0 0)} {2173#true} #67#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {2181#(<= ~counter~0 0)} call #t~ret7 := main(); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2181#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,378 INFO L272 TraceCheckUtils]: 6: Hoare triple {2181#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {2181#(<= ~counter~0 0)} ~cond := #in~cond; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(<= ~counter~0 0)} assume !(0 == ~cond); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2181#(<= ~counter~0 0)} {2181#(<= ~counter~0 0)} #59#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,380 INFO L272 TraceCheckUtils]: 11: Hoare triple {2181#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {2181#(<= ~counter~0 0)} ~cond := #in~cond; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {2181#(<= ~counter~0 0)} assume !(0 == ~cond); {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(<= ~counter~0 0)} assume true; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,381 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2181#(<= ~counter~0 0)} {2181#(<= ~counter~0 0)} #61#return; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {2181#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2181#(<= ~counter~0 0)} is VALID [2022-04-28 13:56:59,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {2181#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {2230#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,384 INFO L272 TraceCheckUtils]: 19: Hoare triple {2230#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {2230#(<= ~counter~0 1)} ~cond := #in~cond; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {2230#(<= ~counter~0 1)} assume !(0 == ~cond); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(<= ~counter~0 1)} assume true; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,386 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(<= ~counter~0 1)} {2230#(<= ~counter~0 1)} #63#return; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {2230#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {2230#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2230#(<= ~counter~0 1)} is VALID [2022-04-28 13:56:59,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {2258#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,389 INFO L272 TraceCheckUtils]: 28: Hoare triple {2258#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {2258#(<= ~counter~0 2)} ~cond := #in~cond; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {2258#(<= ~counter~0 2)} assume !(0 == ~cond); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {2258#(<= ~counter~0 2)} assume true; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,390 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2258#(<= ~counter~0 2)} {2258#(<= ~counter~0 2)} #63#return; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {2258#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {2258#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2258#(<= ~counter~0 2)} is VALID [2022-04-28 13:56:59,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {2258#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {2286#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,393 INFO L272 TraceCheckUtils]: 37: Hoare triple {2286#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {2286#(<= ~counter~0 3)} ~cond := #in~cond; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {2286#(<= ~counter~0 3)} assume !(0 == ~cond); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {2286#(<= ~counter~0 3)} assume true; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,394 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2286#(<= ~counter~0 3)} {2286#(<= ~counter~0 3)} #63#return; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {2286#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {2286#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2286#(<= ~counter~0 3)} is VALID [2022-04-28 13:56:59,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {2286#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2314#(<= |main_#t~post6| 3)} is VALID [2022-04-28 13:56:59,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {2314#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {2174#false} is VALID [2022-04-28 13:56:59,396 INFO L272 TraceCheckUtils]: 46: Hoare triple {2174#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2174#false} is VALID [2022-04-28 13:56:59,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-28 13:56:59,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-28 13:56:59,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-28 13:56:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:56:59,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:56:59,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#false} assume !false; {2174#false} is VALID [2022-04-28 13:56:59,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#false} assume 0 == ~cond; {2174#false} is VALID [2022-04-28 13:56:59,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#false} ~cond := #in~cond; {2174#false} is VALID [2022-04-28 13:56:59,683 INFO L272 TraceCheckUtils]: 46: Hoare triple {2174#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2174#false} is VALID [2022-04-28 13:56:59,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {2342#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2174#false} is VALID [2022-04-28 13:56:59,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {2346#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2342#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:56:59,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {2346#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2346#(< ~counter~0 20)} is VALID [2022-04-28 13:56:59,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {2346#(< ~counter~0 20)} assume !!(0 != ~y3~0); {2346#(< ~counter~0 20)} is VALID [2022-04-28 13:56:59,685 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2173#true} {2346#(< ~counter~0 20)} #63#return; {2346#(< ~counter~0 20)} is VALID [2022-04-28 13:56:59,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:56:59,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:56:59,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:56:59,685 INFO L272 TraceCheckUtils]: 37: Hoare triple {2346#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:56:59,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {2346#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {2346#(< ~counter~0 20)} is VALID [2022-04-28 13:56:59,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {2374#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2346#(< ~counter~0 20)} is VALID [2022-04-28 13:56:59,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {2374#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2374#(< ~counter~0 19)} is VALID [2022-04-28 13:56:59,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {2374#(< ~counter~0 19)} assume !!(0 != ~y3~0); {2374#(< ~counter~0 19)} is VALID [2022-04-28 13:56:59,687 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2173#true} {2374#(< ~counter~0 19)} #63#return; {2374#(< ~counter~0 19)} is VALID [2022-04-28 13:56:59,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:56:59,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:56:59,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:56:59,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {2374#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:56:59,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {2374#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2374#(< ~counter~0 19)} is VALID [2022-04-28 13:56:59,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {2402#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2374#(< ~counter~0 19)} is VALID [2022-04-28 13:56:59,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2402#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2402#(< ~counter~0 18)} is VALID [2022-04-28 13:56:59,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#(< ~counter~0 18)} assume !!(0 != ~y3~0); {2402#(< ~counter~0 18)} is VALID [2022-04-28 13:56:59,689 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2173#true} {2402#(< ~counter~0 18)} #63#return; {2402#(< ~counter~0 18)} is VALID [2022-04-28 13:56:59,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:56:59,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:56:59,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:56:59,689 INFO L272 TraceCheckUtils]: 19: Hoare triple {2402#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:56:59,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {2402#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {2402#(< ~counter~0 18)} is VALID [2022-04-28 13:56:59,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2402#(< ~counter~0 18)} is VALID [2022-04-28 13:56:59,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#(< ~counter~0 17)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,691 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2173#true} {2430#(< ~counter~0 17)} #61#return; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:56:59,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:56:59,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:56:59,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#(< ~counter~0 17)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:56:59,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2173#true} {2430#(< ~counter~0 17)} #59#return; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {2173#true} assume true; {2173#true} is VALID [2022-04-28 13:56:59,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#true} assume !(0 == ~cond); {2173#true} is VALID [2022-04-28 13:56:59,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#true} ~cond := #in~cond; {2173#true} is VALID [2022-04-28 13:56:59,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#(< ~counter~0 17)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2173#true} is VALID [2022-04-28 13:56:59,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#(< ~counter~0 17)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#(< ~counter~0 17)} call #t~ret7 := main(); {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#(< ~counter~0 17)} {2173#true} #67#return; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#(< ~counter~0 17)} assume true; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {2173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2430#(< ~counter~0 17)} is VALID [2022-04-28 13:56:59,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {2173#true} call ULTIMATE.init(); {2173#true} is VALID [2022-04-28 13:56:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 13:56:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:56:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546017134] [2022-04-28 13:56:59,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:56:59,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492144013] [2022-04-28 13:56:59,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492144013] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:56:59,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:56:59,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 13:56:59,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:56:59,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758260425] [2022-04-28 13:56:59,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758260425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:56:59,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:56:59,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:56:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585552541] [2022-04-28 13:56:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:56:59,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 13:56:59,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:56:59,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:56:59,739 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 13:56:59,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:56:59,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:56:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:56:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:56:59,740 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:56:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:56:59,897 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 13:56:59,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:56:59,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 13:56:59,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:56:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:56:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 13:56:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:56:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 13:56:59,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 13:56:59,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:56:59,959 INFO L225 Difference]: With dead ends: 61 [2022-04-28 13:56:59,959 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 13:56:59,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-28 13:56:59,960 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:56:59,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:56:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 13:57:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 13:57:00,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:00,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:00,004 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:00,004 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:00,006 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 13:57:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:57:00,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:00,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:00,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 13:57:00,007 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 13:57:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:00,009 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 13:57:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:57:00,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:00,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:00,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:00,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 13:57:00,011 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-28 13:57:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:00,011 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 13:57:00,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:57:00,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 13:57:00,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:57:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 13:57:00,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:00,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:00,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:00,287 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 13:57:00,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-28 13:57:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:00,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91461333] [2022-04-28 13:57:00,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-28 13:57:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779804999] [2022-04-28 13:57:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:00,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:00,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487806169] [2022-04-28 13:57:00,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:00,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:00,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:00,311 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 13:57:00,337 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 13:57:00,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:00,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:00,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:57:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:00,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:00,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-28 13:57:00,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2844#(<= ~counter~0 0)} {2836#true} #67#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {2844#(<= ~counter~0 0)} call #t~ret7 := main(); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2844#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {2844#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2844#(<= ~counter~0 0)} ~cond := #in~cond; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2844#(<= ~counter~0 0)} assume !(0 == ~cond); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2844#(<= ~counter~0 0)} {2844#(<= ~counter~0 0)} #59#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {2844#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {2844#(<= ~counter~0 0)} ~cond := #in~cond; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {2844#(<= ~counter~0 0)} assume !(0 == ~cond); {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2844#(<= ~counter~0 0)} assume true; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2844#(<= ~counter~0 0)} {2844#(<= ~counter~0 0)} #61#return; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {2844#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2844#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:00,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {2844#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {2893#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,728 INFO L272 TraceCheckUtils]: 19: Hoare triple {2893#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {2893#(<= ~counter~0 1)} ~cond := #in~cond; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {2893#(<= ~counter~0 1)} assume !(0 == ~cond); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {2893#(<= ~counter~0 1)} assume true; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,730 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2893#(<= ~counter~0 1)} {2893#(<= ~counter~0 1)} #63#return; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {2893#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {2893#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2893#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:00,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {2893#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {2921#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {2921#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {2921#(<= ~counter~0 2)} ~cond := #in~cond; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {2921#(<= ~counter~0 2)} assume !(0 == ~cond); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {2921#(<= ~counter~0 2)} assume true; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,734 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2921#(<= ~counter~0 2)} {2921#(<= ~counter~0 2)} #63#return; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {2921#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {2921#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2921#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:00,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {2921#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {2949#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,736 INFO L272 TraceCheckUtils]: 37: Hoare triple {2949#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {2949#(<= ~counter~0 3)} ~cond := #in~cond; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {2949#(<= ~counter~0 3)} assume !(0 == ~cond); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {2949#(<= ~counter~0 3)} assume true; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,738 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2949#(<= ~counter~0 3)} {2949#(<= ~counter~0 3)} #63#return; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {2949#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {2949#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2949#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:00,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {2949#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {2977#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,740 INFO L272 TraceCheckUtils]: 46: Hoare triple {2977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {2977#(<= ~counter~0 4)} ~cond := #in~cond; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {2977#(<= ~counter~0 4)} assume !(0 == ~cond); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {2977#(<= ~counter~0 4)} assume true; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,742 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2977#(<= ~counter~0 4)} {2977#(<= ~counter~0 4)} #63#return; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {2977#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {2977#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2977#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:00,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {2977#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3005#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:57:00,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {3005#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {2837#false} is VALID [2022-04-28 13:57:00,748 INFO L272 TraceCheckUtils]: 55: Hoare triple {2837#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2837#false} is VALID [2022-04-28 13:57:00,748 INFO L290 TraceCheckUtils]: 56: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-28 13:57:00,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-28 13:57:00,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-28 13:57:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:00,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:01,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-04-28 13:57:01,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {2837#false} assume 0 == ~cond; {2837#false} is VALID [2022-04-28 13:57:01,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {2837#false} ~cond := #in~cond; {2837#false} is VALID [2022-04-28 13:57:01,094 INFO L272 TraceCheckUtils]: 55: Hoare triple {2837#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2837#false} is VALID [2022-04-28 13:57:01,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {3033#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2837#false} is VALID [2022-04-28 13:57:01,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {3037#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3033#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:01,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {3037#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3037#(< ~counter~0 20)} is VALID [2022-04-28 13:57:01,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {3037#(< ~counter~0 20)} assume !!(0 != ~y3~0); {3037#(< ~counter~0 20)} is VALID [2022-04-28 13:57:01,097 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2836#true} {3037#(< ~counter~0 20)} #63#return; {3037#(< ~counter~0 20)} is VALID [2022-04-28 13:57:01,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:57:01,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:57:01,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:57:01,098 INFO L272 TraceCheckUtils]: 46: Hoare triple {3037#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:57:01,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {3037#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {3037#(< ~counter~0 20)} is VALID [2022-04-28 13:57:01,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {3065#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3037#(< ~counter~0 20)} is VALID [2022-04-28 13:57:01,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {3065#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3065#(< ~counter~0 19)} is VALID [2022-04-28 13:57:01,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {3065#(< ~counter~0 19)} assume !!(0 != ~y3~0); {3065#(< ~counter~0 19)} is VALID [2022-04-28 13:57:01,104 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2836#true} {3065#(< ~counter~0 19)} #63#return; {3065#(< ~counter~0 19)} is VALID [2022-04-28 13:57:01,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:57:01,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:57:01,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:57:01,105 INFO L272 TraceCheckUtils]: 37: Hoare triple {3065#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:57:01,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {3065#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3065#(< ~counter~0 19)} is VALID [2022-04-28 13:57:01,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {3093#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3065#(< ~counter~0 19)} is VALID [2022-04-28 13:57:01,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {3093#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3093#(< ~counter~0 18)} is VALID [2022-04-28 13:57:01,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {3093#(< ~counter~0 18)} assume !!(0 != ~y3~0); {3093#(< ~counter~0 18)} is VALID [2022-04-28 13:57:01,106 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2836#true} {3093#(< ~counter~0 18)} #63#return; {3093#(< ~counter~0 18)} is VALID [2022-04-28 13:57:01,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:57:01,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:57:01,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:57:01,107 INFO L272 TraceCheckUtils]: 28: Hoare triple {3093#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:57:01,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {3093#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {3093#(< ~counter~0 18)} is VALID [2022-04-28 13:57:01,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {3121#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3093#(< ~counter~0 18)} is VALID [2022-04-28 13:57:01,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3121#(< ~counter~0 17)} is VALID [2022-04-28 13:57:01,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {3121#(< ~counter~0 17)} assume !!(0 != ~y3~0); {3121#(< ~counter~0 17)} is VALID [2022-04-28 13:57:01,108 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2836#true} {3121#(< ~counter~0 17)} #63#return; {3121#(< ~counter~0 17)} is VALID [2022-04-28 13:57:01,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:57:01,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:57:01,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:57:01,109 INFO L272 TraceCheckUtils]: 19: Hoare triple {3121#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:57:01,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {3121#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {3121#(< ~counter~0 17)} is VALID [2022-04-28 13:57:01,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {3149#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3121#(< ~counter~0 17)} is VALID [2022-04-28 13:57:01,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {3149#(< ~counter~0 16)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,110 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2836#true} {3149#(< ~counter~0 16)} #61#return; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:57:01,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:57:01,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:57:01,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {3149#(< ~counter~0 16)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:57:01,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2836#true} {3149#(< ~counter~0 16)} #59#return; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {2836#true} assume true; {2836#true} is VALID [2022-04-28 13:57:01,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {2836#true} assume !(0 == ~cond); {2836#true} is VALID [2022-04-28 13:57:01,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {2836#true} ~cond := #in~cond; {2836#true} is VALID [2022-04-28 13:57:01,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {3149#(< ~counter~0 16)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2836#true} is VALID [2022-04-28 13:57:01,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {3149#(< ~counter~0 16)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {3149#(< ~counter~0 16)} call #t~ret7 := main(); {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3149#(< ~counter~0 16)} {2836#true} #67#return; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {3149#(< ~counter~0 16)} assume true; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3149#(< ~counter~0 16)} is VALID [2022-04-28 13:57:01,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {2836#true} call ULTIMATE.init(); {2836#true} is VALID [2022-04-28 13:57:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 13:57:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:01,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779804999] [2022-04-28 13:57:01,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:01,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487806169] [2022-04-28 13:57:01,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487806169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:01,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:01,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 13:57:01,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:01,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91461333] [2022-04-28 13:57:01,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91461333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:01,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:01,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:57:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545275355] [2022-04-28 13:57:01,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 13:57:01,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:01,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:01,163 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 13:57:01,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:57:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:01,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:57:01,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 13:57:01,164 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:01,371 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-28 13:57:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 13:57:01,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 13:57:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 13:57:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 13:57:01,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 13:57:01,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:01,437 INFO L225 Difference]: With dead ends: 70 [2022-04-28 13:57:01,437 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 13:57:01,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:57:01,438 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:01,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 13:57:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 13:57:01,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:01,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:01,505 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:01,506 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:01,508 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 13:57:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:57:01,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:01,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:01,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 13:57:01,510 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 13:57:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:01,512 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 13:57:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:57:01,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:01,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:01,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:01,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-28 13:57:01,520 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-28 13:57:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:01,521 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-28 13:57:01,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:01,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-28 13:57:01,600 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 13:57:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:57:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 13:57:01,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:01,601 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:01,627 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 13:57:01,827 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 13:57:01,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-28 13:57:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:01,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112877482] [2022-04-28 13:57:01,828 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-28 13:57:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:01,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407311698] [2022-04-28 13:57:01,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:01,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898098189] [2022-04-28 13:57:01,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:01,843 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 13:57:01,867 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 13:57:01,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:01,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:01,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 13:57:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:01,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:02,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {3611#true} call ULTIMATE.init(); {3611#true} is VALID [2022-04-28 13:57:02,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3619#(<= ~counter~0 0)} {3611#true} #67#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {3619#(<= ~counter~0 0)} call #t~ret7 := main(); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {3619#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,251 INFO L272 TraceCheckUtils]: 6: Hoare triple {3619#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {3619#(<= ~counter~0 0)} ~cond := #in~cond; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {3619#(<= ~counter~0 0)} assume !(0 == ~cond); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3619#(<= ~counter~0 0)} {3619#(<= ~counter~0 0)} #59#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {3619#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(<= ~counter~0 0)} ~cond := #in~cond; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(<= ~counter~0 0)} assume !(0 == ~cond); {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {3619#(<= ~counter~0 0)} assume true; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,254 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3619#(<= ~counter~0 0)} {3619#(<= ~counter~0 0)} #61#return; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:02,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {3619#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {3668#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {3668#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {3668#(<= ~counter~0 1)} ~cond := #in~cond; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {3668#(<= ~counter~0 1)} assume !(0 == ~cond); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {3668#(<= ~counter~0 1)} assume true; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3668#(<= ~counter~0 1)} {3668#(<= ~counter~0 1)} #63#return; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {3668#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {3668#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:02,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {3668#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {3696#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,259 INFO L272 TraceCheckUtils]: 28: Hoare triple {3696#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {3696#(<= ~counter~0 2)} ~cond := #in~cond; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {3696#(<= ~counter~0 2)} assume !(0 == ~cond); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {3696#(<= ~counter~0 2)} assume true; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,260 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3696#(<= ~counter~0 2)} {3696#(<= ~counter~0 2)} #63#return; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {3696#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {3696#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:02,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {3696#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {3724#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,262 INFO L272 TraceCheckUtils]: 37: Hoare triple {3724#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {3724#(<= ~counter~0 3)} ~cond := #in~cond; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {3724#(<= ~counter~0 3)} assume !(0 == ~cond); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {3724#(<= ~counter~0 3)} assume true; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,263 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3724#(<= ~counter~0 3)} {3724#(<= ~counter~0 3)} #63#return; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {3724#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {3724#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:02,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {3724#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {3752#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,265 INFO L272 TraceCheckUtils]: 46: Hoare triple {3752#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {3752#(<= ~counter~0 4)} ~cond := #in~cond; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {3752#(<= ~counter~0 4)} assume !(0 == ~cond); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {3752#(<= ~counter~0 4)} assume true; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,267 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3752#(<= ~counter~0 4)} {3752#(<= ~counter~0 4)} #63#return; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {3752#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {3752#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:02,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {3752#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {3780#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,269 INFO L272 TraceCheckUtils]: 55: Hoare triple {3780#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {3780#(<= ~counter~0 5)} ~cond := #in~cond; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,269 INFO L290 TraceCheckUtils]: 57: Hoare triple {3780#(<= ~counter~0 5)} assume !(0 == ~cond); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {3780#(<= ~counter~0 5)} assume true; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,270 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3780#(<= ~counter~0 5)} {3780#(<= ~counter~0 5)} #63#return; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,270 INFO L290 TraceCheckUtils]: 60: Hoare triple {3780#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {3780#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:02,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {3780#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3808#(<= |main_#t~post6| 5)} is VALID [2022-04-28 13:57:02,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {3808#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {3612#false} is VALID [2022-04-28 13:57:02,271 INFO L272 TraceCheckUtils]: 64: Hoare triple {3612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {3612#false} is VALID [2022-04-28 13:57:02,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#false} ~cond := #in~cond; {3612#false} is VALID [2022-04-28 13:57:02,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#false} assume 0 == ~cond; {3612#false} is VALID [2022-04-28 13:57:02,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#false} assume !false; {3612#false} is VALID [2022-04-28 13:57:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:02,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:02,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {3612#false} assume !false; {3612#false} is VALID [2022-04-28 13:57:02,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {3612#false} assume 0 == ~cond; {3612#false} is VALID [2022-04-28 13:57:02,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {3612#false} ~cond := #in~cond; {3612#false} is VALID [2022-04-28 13:57:02,659 INFO L272 TraceCheckUtils]: 64: Hoare triple {3612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {3612#false} is VALID [2022-04-28 13:57:02,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {3836#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3612#false} is VALID [2022-04-28 13:57:02,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {3840#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3836#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:02,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {3840#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3840#(< ~counter~0 20)} is VALID [2022-04-28 13:57:02,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {3840#(< ~counter~0 20)} assume !!(0 != ~y3~0); {3840#(< ~counter~0 20)} is VALID [2022-04-28 13:57:02,664 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3611#true} {3840#(< ~counter~0 20)} #63#return; {3840#(< ~counter~0 20)} is VALID [2022-04-28 13:57:02,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,665 INFO L272 TraceCheckUtils]: 55: Hoare triple {3840#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {3840#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {3840#(< ~counter~0 20)} is VALID [2022-04-28 13:57:02,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {3868#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3840#(< ~counter~0 20)} is VALID [2022-04-28 13:57:02,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {3868#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3868#(< ~counter~0 19)} is VALID [2022-04-28 13:57:02,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {3868#(< ~counter~0 19)} assume !!(0 != ~y3~0); {3868#(< ~counter~0 19)} is VALID [2022-04-28 13:57:02,667 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3611#true} {3868#(< ~counter~0 19)} #63#return; {3868#(< ~counter~0 19)} is VALID [2022-04-28 13:57:02,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,668 INFO L290 TraceCheckUtils]: 47: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,668 INFO L272 TraceCheckUtils]: 46: Hoare triple {3868#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {3868#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3868#(< ~counter~0 19)} is VALID [2022-04-28 13:57:02,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {3896#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3868#(< ~counter~0 19)} is VALID [2022-04-28 13:57:02,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {3896#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3896#(< ~counter~0 18)} is VALID [2022-04-28 13:57:02,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {3896#(< ~counter~0 18)} assume !!(0 != ~y3~0); {3896#(< ~counter~0 18)} is VALID [2022-04-28 13:57:02,670 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3611#true} {3896#(< ~counter~0 18)} #63#return; {3896#(< ~counter~0 18)} is VALID [2022-04-28 13:57:02,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,671 INFO L272 TraceCheckUtils]: 37: Hoare triple {3896#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {3896#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {3896#(< ~counter~0 18)} is VALID [2022-04-28 13:57:02,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {3924#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3896#(< ~counter~0 18)} is VALID [2022-04-28 13:57:02,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {3924#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3924#(< ~counter~0 17)} is VALID [2022-04-28 13:57:02,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {3924#(< ~counter~0 17)} assume !!(0 != ~y3~0); {3924#(< ~counter~0 17)} is VALID [2022-04-28 13:57:02,672 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3611#true} {3924#(< ~counter~0 17)} #63#return; {3924#(< ~counter~0 17)} is VALID [2022-04-28 13:57:02,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,673 INFO L272 TraceCheckUtils]: 28: Hoare triple {3924#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {3924#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {3924#(< ~counter~0 17)} is VALID [2022-04-28 13:57:02,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {3952#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3924#(< ~counter~0 17)} is VALID [2022-04-28 13:57:02,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {3952#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3952#(< ~counter~0 16)} is VALID [2022-04-28 13:57:02,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {3952#(< ~counter~0 16)} assume !!(0 != ~y3~0); {3952#(< ~counter~0 16)} is VALID [2022-04-28 13:57:02,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3611#true} {3952#(< ~counter~0 16)} #63#return; {3952#(< ~counter~0 16)} is VALID [2022-04-28 13:57:02,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {3952#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {3952#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {3952#(< ~counter~0 16)} is VALID [2022-04-28 13:57:02,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {3980#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3952#(< ~counter~0 16)} is VALID [2022-04-28 13:57:02,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {3980#(< ~counter~0 15)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3611#true} {3980#(< ~counter~0 15)} #61#return; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {3980#(< ~counter~0 15)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3611#true} {3980#(< ~counter~0 15)} #59#return; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {3611#true} assume true; {3611#true} is VALID [2022-04-28 13:57:02,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {3611#true} assume !(0 == ~cond); {3611#true} is VALID [2022-04-28 13:57:02,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {3611#true} ~cond := #in~cond; {3611#true} is VALID [2022-04-28 13:57:02,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {3980#(< ~counter~0 15)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {3611#true} is VALID [2022-04-28 13:57:02,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {3980#(< ~counter~0 15)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {3980#(< ~counter~0 15)} call #t~ret7 := main(); {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3980#(< ~counter~0 15)} {3611#true} #67#return; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#(< ~counter~0 15)} assume true; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {3611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3980#(< ~counter~0 15)} is VALID [2022-04-28 13:57:02,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {3611#true} call ULTIMATE.init(); {3611#true} is VALID [2022-04-28 13:57:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 13:57:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407311698] [2022-04-28 13:57:02,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:02,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898098189] [2022-04-28 13:57:02,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898098189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:02,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:02,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 13:57:02,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:02,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112877482] [2022-04-28 13:57:02,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112877482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:02,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 13:57:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944852039] [2022-04-28 13:57:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 13:57:02,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:02,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:57:02,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:02,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 13:57:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 13:57:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 13:57:02,728 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:57:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:02,928 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-28 13:57:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 13:57:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 13:57:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:57:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 13:57:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:57:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 13:57:02,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-28 13:57:02,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:02,990 INFO L225 Difference]: With dead ends: 79 [2022-04-28 13:57:02,990 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 13:57:02,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-28 13:57:02,991 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:02,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 13:57:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 13:57:03,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:03,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:57:03,056 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:57:03,056 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:57:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:03,058 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 13:57:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 13:57:03,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:03,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:03,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 13:57:03,072 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 13:57:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:03,074 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 13:57:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 13:57:03,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:03,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:03,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:03,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 13:57:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-04-28 13:57:03,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 68 [2022-04-28 13:57:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:03,077 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-04-28 13:57:03,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 13:57:03,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2022-04-28 13:57:03,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 13:57:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 13:57:03,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:03,165 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:03,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 13:57:03,365 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 13:57:03,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 11 times [2022-04-28 13:57:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:03,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644581883] [2022-04-28 13:57:03,366 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:03,366 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 12 times [2022-04-28 13:57:03,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:03,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3040577] [2022-04-28 13:57:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:03,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:03,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645556869] [2022-04-28 13:57:03,381 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:57:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:03,382 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 13:57:03,386 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 13:57:03,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 13:57:03,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:03,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 13:57:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:03,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:03,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4498#true} is VALID [2022-04-28 13:57:03,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {4506#(<= ~counter~0 0)} assume true; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4506#(<= ~counter~0 0)} {4498#true} #67#return; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {4506#(<= ~counter~0 0)} call #t~ret7 := main(); {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {4506#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {4506#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {4506#(<= ~counter~0 0)} ~cond := #in~cond; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {4506#(<= ~counter~0 0)} assume !(0 == ~cond); {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {4506#(<= ~counter~0 0)} assume true; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4506#(<= ~counter~0 0)} {4506#(<= ~counter~0 0)} #59#return; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {4506#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {4506#(<= ~counter~0 0)} ~cond := #in~cond; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {4506#(<= ~counter~0 0)} assume !(0 == ~cond); {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {4506#(<= ~counter~0 0)} assume true; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,837 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4506#(<= ~counter~0 0)} {4506#(<= ~counter~0 0)} #61#return; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {4506#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4506#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:03,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {4506#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {4555#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {4555#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {4555#(<= ~counter~0 1)} ~cond := #in~cond; {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#(<= ~counter~0 1)} assume !(0 == ~cond); {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#(<= ~counter~0 1)} assume true; {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,841 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4555#(<= ~counter~0 1)} {4555#(<= ~counter~0 1)} #63#return; {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {4555#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4555#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:03,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {4583#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,843 INFO L272 TraceCheckUtils]: 28: Hoare triple {4583#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {4583#(<= ~counter~0 2)} ~cond := #in~cond; {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {4583#(<= ~counter~0 2)} assume !(0 == ~cond); {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {4583#(<= ~counter~0 2)} assume true; {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,845 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4583#(<= ~counter~0 2)} {4583#(<= ~counter~0 2)} #63#return; {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {4583#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {4583#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4583#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:03,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {4583#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {4611#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,847 INFO L272 TraceCheckUtils]: 37: Hoare triple {4611#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {4611#(<= ~counter~0 3)} ~cond := #in~cond; {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {4611#(<= ~counter~0 3)} assume !(0 == ~cond); {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,848 INFO L290 TraceCheckUtils]: 40: Hoare triple {4611#(<= ~counter~0 3)} assume true; {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,849 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4611#(<= ~counter~0 3)} {4611#(<= ~counter~0 3)} #63#return; {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {4611#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,849 INFO L290 TraceCheckUtils]: 43: Hoare triple {4611#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4611#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:03,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {4611#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {4639#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,851 INFO L272 TraceCheckUtils]: 46: Hoare triple {4639#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,851 INFO L290 TraceCheckUtils]: 47: Hoare triple {4639#(<= ~counter~0 4)} ~cond := #in~cond; {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {4639#(<= ~counter~0 4)} assume !(0 == ~cond); {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {4639#(<= ~counter~0 4)} assume true; {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,853 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4639#(<= ~counter~0 4)} {4639#(<= ~counter~0 4)} #63#return; {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {4639#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {4639#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4639#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:03,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {4639#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {4667#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,855 INFO L272 TraceCheckUtils]: 55: Hoare triple {4667#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {4667#(<= ~counter~0 5)} ~cond := #in~cond; {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {4667#(<= ~counter~0 5)} assume !(0 == ~cond); {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {4667#(<= ~counter~0 5)} assume true; {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,856 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4667#(<= ~counter~0 5)} {4667#(<= ~counter~0 5)} #63#return; {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {4667#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {4667#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4667#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:03,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {4667#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {4695#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,858 INFO L272 TraceCheckUtils]: 64: Hoare triple {4695#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {4695#(<= ~counter~0 6)} ~cond := #in~cond; {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {4695#(<= ~counter~0 6)} assume !(0 == ~cond); {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {4695#(<= ~counter~0 6)} assume true; {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,860 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4695#(<= ~counter~0 6)} {4695#(<= ~counter~0 6)} #63#return; {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {4695#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {4695#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4695#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:03,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {4695#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4723#(<= |main_#t~post6| 6)} is VALID [2022-04-28 13:57:03,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {4723#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {4499#false} is VALID [2022-04-28 13:57:03,862 INFO L272 TraceCheckUtils]: 73: Hoare triple {4499#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4499#false} is VALID [2022-04-28 13:57:03,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-28 13:57:03,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-28 13:57:03,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-28 13:57:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:03,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:04,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {4499#false} assume !false; {4499#false} is VALID [2022-04-28 13:57:04,241 INFO L290 TraceCheckUtils]: 75: Hoare triple {4499#false} assume 0 == ~cond; {4499#false} is VALID [2022-04-28 13:57:04,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {4499#false} ~cond := #in~cond; {4499#false} is VALID [2022-04-28 13:57:04,241 INFO L272 TraceCheckUtils]: 73: Hoare triple {4499#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {4499#false} is VALID [2022-04-28 13:57:04,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {4751#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {4499#false} is VALID [2022-04-28 13:57:04,242 INFO L290 TraceCheckUtils]: 71: Hoare triple {4755#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4751#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:04,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {4755#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4755#(< ~counter~0 20)} is VALID [2022-04-28 13:57:04,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {4755#(< ~counter~0 20)} assume !!(0 != ~y3~0); {4755#(< ~counter~0 20)} is VALID [2022-04-28 13:57:04,243 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4498#true} {4755#(< ~counter~0 20)} #63#return; {4755#(< ~counter~0 20)} is VALID [2022-04-28 13:57:04,243 INFO L290 TraceCheckUtils]: 67: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,243 INFO L290 TraceCheckUtils]: 66: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,243 INFO L272 TraceCheckUtils]: 64: Hoare triple {4755#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {4755#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {4755#(< ~counter~0 20)} is VALID [2022-04-28 13:57:04,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {4783#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4755#(< ~counter~0 20)} is VALID [2022-04-28 13:57:04,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {4783#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4783#(< ~counter~0 19)} is VALID [2022-04-28 13:57:04,245 INFO L290 TraceCheckUtils]: 60: Hoare triple {4783#(< ~counter~0 19)} assume !!(0 != ~y3~0); {4783#(< ~counter~0 19)} is VALID [2022-04-28 13:57:04,245 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4498#true} {4783#(< ~counter~0 19)} #63#return; {4783#(< ~counter~0 19)} is VALID [2022-04-28 13:57:04,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,245 INFO L272 TraceCheckUtils]: 55: Hoare triple {4783#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {4783#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {4783#(< ~counter~0 19)} is VALID [2022-04-28 13:57:04,246 INFO L290 TraceCheckUtils]: 53: Hoare triple {4811#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4783#(< ~counter~0 19)} is VALID [2022-04-28 13:57:04,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {4811#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4811#(< ~counter~0 18)} is VALID [2022-04-28 13:57:04,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {4811#(< ~counter~0 18)} assume !!(0 != ~y3~0); {4811#(< ~counter~0 18)} is VALID [2022-04-28 13:57:04,247 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4498#true} {4811#(< ~counter~0 18)} #63#return; {4811#(< ~counter~0 18)} is VALID [2022-04-28 13:57:04,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,247 INFO L272 TraceCheckUtils]: 46: Hoare triple {4811#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {4811#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {4811#(< ~counter~0 18)} is VALID [2022-04-28 13:57:04,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {4839#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4811#(< ~counter~0 18)} is VALID [2022-04-28 13:57:04,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {4839#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4839#(< ~counter~0 17)} is VALID [2022-04-28 13:57:04,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {4839#(< ~counter~0 17)} assume !!(0 != ~y3~0); {4839#(< ~counter~0 17)} is VALID [2022-04-28 13:57:04,249 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4498#true} {4839#(< ~counter~0 17)} #63#return; {4839#(< ~counter~0 17)} is VALID [2022-04-28 13:57:04,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,249 INFO L272 TraceCheckUtils]: 37: Hoare triple {4839#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {4839#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {4839#(< ~counter~0 17)} is VALID [2022-04-28 13:57:04,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {4867#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4839#(< ~counter~0 17)} is VALID [2022-04-28 13:57:04,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {4867#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4867#(< ~counter~0 16)} is VALID [2022-04-28 13:57:04,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {4867#(< ~counter~0 16)} assume !!(0 != ~y3~0); {4867#(< ~counter~0 16)} is VALID [2022-04-28 13:57:04,251 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4498#true} {4867#(< ~counter~0 16)} #63#return; {4867#(< ~counter~0 16)} is VALID [2022-04-28 13:57:04,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,251 INFO L272 TraceCheckUtils]: 28: Hoare triple {4867#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {4867#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {4867#(< ~counter~0 16)} is VALID [2022-04-28 13:57:04,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {4895#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4867#(< ~counter~0 16)} is VALID [2022-04-28 13:57:04,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {4895#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {4895#(< ~counter~0 15)} is VALID [2022-04-28 13:57:04,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {4895#(< ~counter~0 15)} assume !!(0 != ~y3~0); {4895#(< ~counter~0 15)} is VALID [2022-04-28 13:57:04,269 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4498#true} {4895#(< ~counter~0 15)} #63#return; {4895#(< ~counter~0 15)} is VALID [2022-04-28 13:57:04,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {4895#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {4895#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {4895#(< ~counter~0 15)} is VALID [2022-04-28 13:57:04,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {4923#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4895#(< ~counter~0 15)} is VALID [2022-04-28 13:57:04,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {4923#(< ~counter~0 14)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,271 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4498#true} {4923#(< ~counter~0 14)} #61#return; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,271 INFO L272 TraceCheckUtils]: 11: Hoare triple {4923#(< ~counter~0 14)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,272 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4498#true} {4923#(< ~counter~0 14)} #59#return; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {4498#true} assume true; {4498#true} is VALID [2022-04-28 13:57:04,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {4498#true} assume !(0 == ~cond); {4498#true} is VALID [2022-04-28 13:57:04,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {4498#true} ~cond := #in~cond; {4498#true} is VALID [2022-04-28 13:57:04,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {4923#(< ~counter~0 14)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {4498#true} is VALID [2022-04-28 13:57:04,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {4923#(< ~counter~0 14)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {4923#(< ~counter~0 14)} call #t~ret7 := main(); {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4923#(< ~counter~0 14)} {4498#true} #67#return; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {4923#(< ~counter~0 14)} assume true; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {4498#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4923#(< ~counter~0 14)} is VALID [2022-04-28 13:57:04,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {4498#true} call ULTIMATE.init(); {4498#true} is VALID [2022-04-28 13:57:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 13:57:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3040577] [2022-04-28 13:57:04,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645556869] [2022-04-28 13:57:04,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645556869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:04,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 13:57:04,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644581883] [2022-04-28 13:57:04,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644581883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:04,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 13:57:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478275389] [2022-04-28 13:57:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 13:57:04,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:04,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:57:04,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:04,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 13:57:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 13:57:04,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 13:57:04,334 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:57:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:04,582 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-28 13:57:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 13:57:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 13:57:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:57:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 13:57:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:57:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 13:57:04,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2022-04-28 13:57:04,649 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 13:57:04,650 INFO L225 Difference]: With dead ends: 88 [2022-04-28 13:57:04,650 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 13:57:04,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:04,651 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:04,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 13:57:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 13:57:04,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:04,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:57:04,725 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:57:04,726 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:57:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:04,728 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 13:57:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 13:57:04,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:04,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:04,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 13:57:04,728 INFO L87 Difference]: Start difference. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 13:57:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:04,730 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 13:57:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 13:57:04,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:04,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:04,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:04,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 13:57:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-28 13:57:04,732 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 77 [2022-04-28 13:57:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:04,732 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-28 13:57:04,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 13:57:04,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-28 13:57:04,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 13:57:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 13:57:04,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:04,839 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:04,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:05,044 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 13:57:05,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 13 times [2022-04-28 13:57:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172090950] [2022-04-28 13:57:05,045 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 14 times [2022-04-28 13:57:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:05,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324898154] [2022-04-28 13:57:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:05,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:05,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033403174] [2022-04-28 13:57:05,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:05,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:05,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:05,059 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 13:57:05,066 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 13:57:05,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:05,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:05,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 13:57:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:05,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:05,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-28 13:57:05,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {5505#(<= ~counter~0 0)} assume true; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5505#(<= ~counter~0 0)} {5497#true} #67#return; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {5505#(<= ~counter~0 0)} call #t~ret7 := main(); {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {5505#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {5505#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {5505#(<= ~counter~0 0)} ~cond := #in~cond; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {5505#(<= ~counter~0 0)} assume !(0 == ~cond); {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {5505#(<= ~counter~0 0)} assume true; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5505#(<= ~counter~0 0)} {5505#(<= ~counter~0 0)} #59#return; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,622 INFO L272 TraceCheckUtils]: 11: Hoare triple {5505#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {5505#(<= ~counter~0 0)} ~cond := #in~cond; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {5505#(<= ~counter~0 0)} assume !(0 == ~cond); {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {5505#(<= ~counter~0 0)} assume true; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,624 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5505#(<= ~counter~0 0)} {5505#(<= ~counter~0 0)} #61#return; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {5505#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5505#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:05,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {5505#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {5554#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,625 INFO L272 TraceCheckUtils]: 19: Hoare triple {5554#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {5554#(<= ~counter~0 1)} ~cond := #in~cond; {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {5554#(<= ~counter~0 1)} assume !(0 == ~cond); {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {5554#(<= ~counter~0 1)} assume true; {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,627 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5554#(<= ~counter~0 1)} {5554#(<= ~counter~0 1)} #63#return; {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {5554#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {5554#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5554#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:05,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {5554#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {5582#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,628 INFO L272 TraceCheckUtils]: 28: Hoare triple {5582#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#(<= ~counter~0 2)} ~cond := #in~cond; {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#(<= ~counter~0 2)} assume !(0 == ~cond); {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {5582#(<= ~counter~0 2)} assume true; {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,630 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5582#(<= ~counter~0 2)} {5582#(<= ~counter~0 2)} #63#return; {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {5582#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {5582#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5582#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:05,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {5582#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {5610#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,631 INFO L272 TraceCheckUtils]: 37: Hoare triple {5610#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {5610#(<= ~counter~0 3)} ~cond := #in~cond; {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {5610#(<= ~counter~0 3)} assume !(0 == ~cond); {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {5610#(<= ~counter~0 3)} assume true; {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,633 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5610#(<= ~counter~0 3)} {5610#(<= ~counter~0 3)} #63#return; {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {5610#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {5610#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5610#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:05,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {5610#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {5638#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,637 INFO L272 TraceCheckUtils]: 46: Hoare triple {5638#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {5638#(<= ~counter~0 4)} ~cond := #in~cond; {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {5638#(<= ~counter~0 4)} assume !(0 == ~cond); {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {5638#(<= ~counter~0 4)} assume true; {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,639 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5638#(<= ~counter~0 4)} {5638#(<= ~counter~0 4)} #63#return; {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {5638#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {5638#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5638#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:05,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {5638#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {5666#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,642 INFO L272 TraceCheckUtils]: 55: Hoare triple {5666#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,642 INFO L290 TraceCheckUtils]: 56: Hoare triple {5666#(<= ~counter~0 5)} ~cond := #in~cond; {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {5666#(<= ~counter~0 5)} assume !(0 == ~cond); {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {5666#(<= ~counter~0 5)} assume true; {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,644 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5666#(<= ~counter~0 5)} {5666#(<= ~counter~0 5)} #63#return; {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {5666#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {5666#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5666#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:05,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {5666#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,645 INFO L290 TraceCheckUtils]: 63: Hoare triple {5694#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,646 INFO L272 TraceCheckUtils]: 64: Hoare triple {5694#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {5694#(<= ~counter~0 6)} ~cond := #in~cond; {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {5694#(<= ~counter~0 6)} assume !(0 == ~cond); {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {5694#(<= ~counter~0 6)} assume true; {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,648 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5694#(<= ~counter~0 6)} {5694#(<= ~counter~0 6)} #63#return; {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,649 INFO L290 TraceCheckUtils]: 69: Hoare triple {5694#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,649 INFO L290 TraceCheckUtils]: 70: Hoare triple {5694#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5694#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:05,649 INFO L290 TraceCheckUtils]: 71: Hoare triple {5694#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,650 INFO L290 TraceCheckUtils]: 72: Hoare triple {5722#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,651 INFO L272 TraceCheckUtils]: 73: Hoare triple {5722#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {5722#(<= ~counter~0 7)} ~cond := #in~cond; {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,651 INFO L290 TraceCheckUtils]: 75: Hoare triple {5722#(<= ~counter~0 7)} assume !(0 == ~cond); {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {5722#(<= ~counter~0 7)} assume true; {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,653 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5722#(<= ~counter~0 7)} {5722#(<= ~counter~0 7)} #63#return; {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,653 INFO L290 TraceCheckUtils]: 78: Hoare triple {5722#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,653 INFO L290 TraceCheckUtils]: 79: Hoare triple {5722#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5722#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:05,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {5722#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5750#(<= |main_#t~post6| 7)} is VALID [2022-04-28 13:57:05,654 INFO L290 TraceCheckUtils]: 81: Hoare triple {5750#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {5498#false} is VALID [2022-04-28 13:57:05,654 INFO L272 TraceCheckUtils]: 82: Hoare triple {5498#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {5498#false} is VALID [2022-04-28 13:57:05,654 INFO L290 TraceCheckUtils]: 83: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-28 13:57:05,654 INFO L290 TraceCheckUtils]: 84: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-28 13:57:05,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-28 13:57:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:05,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:06,125 INFO L290 TraceCheckUtils]: 85: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-28 13:57:06,125 INFO L290 TraceCheckUtils]: 84: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-28 13:57:06,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-28 13:57:06,125 INFO L272 TraceCheckUtils]: 82: Hoare triple {5498#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {5498#false} is VALID [2022-04-28 13:57:06,128 INFO L290 TraceCheckUtils]: 81: Hoare triple {5778#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5498#false} is VALID [2022-04-28 13:57:06,128 INFO L290 TraceCheckUtils]: 80: Hoare triple {5782#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5778#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:06,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {5782#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5782#(< ~counter~0 20)} is VALID [2022-04-28 13:57:06,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {5782#(< ~counter~0 20)} assume !!(0 != ~y3~0); {5782#(< ~counter~0 20)} is VALID [2022-04-28 13:57:06,129 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5497#true} {5782#(< ~counter~0 20)} #63#return; {5782#(< ~counter~0 20)} is VALID [2022-04-28 13:57:06,130 INFO L290 TraceCheckUtils]: 76: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,130 INFO L290 TraceCheckUtils]: 74: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,130 INFO L272 TraceCheckUtils]: 73: Hoare triple {5782#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {5782#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {5782#(< ~counter~0 20)} is VALID [2022-04-28 13:57:06,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {5810#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5782#(< ~counter~0 20)} is VALID [2022-04-28 13:57:06,132 INFO L290 TraceCheckUtils]: 70: Hoare triple {5810#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5810#(< ~counter~0 19)} is VALID [2022-04-28 13:57:06,132 INFO L290 TraceCheckUtils]: 69: Hoare triple {5810#(< ~counter~0 19)} assume !!(0 != ~y3~0); {5810#(< ~counter~0 19)} is VALID [2022-04-28 13:57:06,132 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5497#true} {5810#(< ~counter~0 19)} #63#return; {5810#(< ~counter~0 19)} is VALID [2022-04-28 13:57:06,132 INFO L290 TraceCheckUtils]: 67: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,132 INFO L290 TraceCheckUtils]: 66: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,133 INFO L272 TraceCheckUtils]: 64: Hoare triple {5810#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {5810#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {5810#(< ~counter~0 19)} is VALID [2022-04-28 13:57:06,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {5838#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5810#(< ~counter~0 19)} is VALID [2022-04-28 13:57:06,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {5838#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5838#(< ~counter~0 18)} is VALID [2022-04-28 13:57:06,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {5838#(< ~counter~0 18)} assume !!(0 != ~y3~0); {5838#(< ~counter~0 18)} is VALID [2022-04-28 13:57:06,134 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5497#true} {5838#(< ~counter~0 18)} #63#return; {5838#(< ~counter~0 18)} is VALID [2022-04-28 13:57:06,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,135 INFO L272 TraceCheckUtils]: 55: Hoare triple {5838#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {5838#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {5838#(< ~counter~0 18)} is VALID [2022-04-28 13:57:06,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {5866#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5838#(< ~counter~0 18)} is VALID [2022-04-28 13:57:06,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {5866#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5866#(< ~counter~0 17)} is VALID [2022-04-28 13:57:06,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {5866#(< ~counter~0 17)} assume !!(0 != ~y3~0); {5866#(< ~counter~0 17)} is VALID [2022-04-28 13:57:06,136 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5497#true} {5866#(< ~counter~0 17)} #63#return; {5866#(< ~counter~0 17)} is VALID [2022-04-28 13:57:06,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,137 INFO L272 TraceCheckUtils]: 46: Hoare triple {5866#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {5866#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {5866#(< ~counter~0 17)} is VALID [2022-04-28 13:57:06,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {5894#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5866#(< ~counter~0 17)} is VALID [2022-04-28 13:57:06,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {5894#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5894#(< ~counter~0 16)} is VALID [2022-04-28 13:57:06,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {5894#(< ~counter~0 16)} assume !!(0 != ~y3~0); {5894#(< ~counter~0 16)} is VALID [2022-04-28 13:57:06,138 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5497#true} {5894#(< ~counter~0 16)} #63#return; {5894#(< ~counter~0 16)} is VALID [2022-04-28 13:57:06,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,138 INFO L272 TraceCheckUtils]: 37: Hoare triple {5894#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {5894#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {5894#(< ~counter~0 16)} is VALID [2022-04-28 13:57:06,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {5922#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5894#(< ~counter~0 16)} is VALID [2022-04-28 13:57:06,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {5922#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5922#(< ~counter~0 15)} is VALID [2022-04-28 13:57:06,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {5922#(< ~counter~0 15)} assume !!(0 != ~y3~0); {5922#(< ~counter~0 15)} is VALID [2022-04-28 13:57:06,140 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5497#true} {5922#(< ~counter~0 15)} #63#return; {5922#(< ~counter~0 15)} is VALID [2022-04-28 13:57:06,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,140 INFO L272 TraceCheckUtils]: 28: Hoare triple {5922#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {5922#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {5922#(< ~counter~0 15)} is VALID [2022-04-28 13:57:06,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {5950#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5922#(< ~counter~0 15)} is VALID [2022-04-28 13:57:06,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {5950#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {5950#(< ~counter~0 14)} is VALID [2022-04-28 13:57:06,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {5950#(< ~counter~0 14)} assume !!(0 != ~y3~0); {5950#(< ~counter~0 14)} is VALID [2022-04-28 13:57:06,142 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5497#true} {5950#(< ~counter~0 14)} #63#return; {5950#(< ~counter~0 14)} is VALID [2022-04-28 13:57:06,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,142 INFO L272 TraceCheckUtils]: 19: Hoare triple {5950#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {5950#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {5950#(< ~counter~0 14)} is VALID [2022-04-28 13:57:06,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {5978#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5950#(< ~counter~0 14)} is VALID [2022-04-28 13:57:06,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {5978#(< ~counter~0 13)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5497#true} {5978#(< ~counter~0 13)} #61#return; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L272 TraceCheckUtils]: 11: Hoare triple {5978#(< ~counter~0 13)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5497#true} {5978#(< ~counter~0 13)} #59#return; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-28 13:57:06,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {5978#(< ~counter~0 13)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {5497#true} is VALID [2022-04-28 13:57:06,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {5978#(< ~counter~0 13)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {5978#(< ~counter~0 13)} call #t~ret7 := main(); {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5978#(< ~counter~0 13)} {5497#true} #67#return; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {5978#(< ~counter~0 13)} assume true; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5978#(< ~counter~0 13)} is VALID [2022-04-28 13:57:06,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-28 13:57:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 13:57:06,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:06,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324898154] [2022-04-28 13:57:06,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:06,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033403174] [2022-04-28 13:57:06,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033403174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:06,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:06,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 13:57:06,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:06,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172090950] [2022-04-28 13:57:06,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172090950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:06,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:06,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 13:57:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756451726] [2022-04-28 13:57:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:06,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 13:57:06,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:06,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:57:06,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:06,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 13:57:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 13:57:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 13:57:06,204 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:57:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:06,505 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-28 13:57:06,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 13:57:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 13:57:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:57:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 13:57:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:57:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 13:57:06,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 105 transitions. [2022-04-28 13:57:06,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:06,597 INFO L225 Difference]: With dead ends: 97 [2022-04-28 13:57:06,597 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 13:57:06,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 13:57:06,598 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:06,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 126 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 13:57:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 13:57:06,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:06,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:57:06,686 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:57:06,686 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:57:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:06,688 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 13:57:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 13:57:06,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:06,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:06,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 13:57:06,689 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 13:57:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:06,690 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 13:57:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 13:57:06,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:06,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:06,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:06,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 13:57:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-04-28 13:57:06,693 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 86 [2022-04-28 13:57:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:06,693 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-04-28 13:57:06,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 13:57:06,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 101 transitions. [2022-04-28 13:57:06,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 13:57:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 13:57:06,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:06,787 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:06,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:06,987 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 13:57:06,987 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 15 times [2022-04-28 13:57:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [792597307] [2022-04-28 13:57:06,988 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 16 times [2022-04-28 13:57:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053592365] [2022-04-28 13:57:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:07,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:07,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315799395] [2022-04-28 13:57:07,012 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:07,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:07,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:07,015 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 13:57:07,017 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 13:57:07,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:07,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:07,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 13:57:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:07,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:07,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {6608#true} call ULTIMATE.init(); {6608#true} is VALID [2022-04-28 13:57:07,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {6608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {6616#(<= ~counter~0 0)} assume true; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6616#(<= ~counter~0 0)} {6608#true} #67#return; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {6616#(<= ~counter~0 0)} call #t~ret7 := main(); {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {6616#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {6616#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {6616#(<= ~counter~0 0)} ~cond := #in~cond; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {6616#(<= ~counter~0 0)} assume !(0 == ~cond); {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {6616#(<= ~counter~0 0)} assume true; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6616#(<= ~counter~0 0)} {6616#(<= ~counter~0 0)} #59#return; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {6616#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {6616#(<= ~counter~0 0)} ~cond := #in~cond; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {6616#(<= ~counter~0 0)} assume !(0 == ~cond); {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {6616#(<= ~counter~0 0)} assume true; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6616#(<= ~counter~0 0)} {6616#(<= ~counter~0 0)} #61#return; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {6616#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {6616#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:07,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {6616#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {6665#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {6665#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {6665#(<= ~counter~0 1)} ~cond := #in~cond; {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {6665#(<= ~counter~0 1)} assume !(0 == ~cond); {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {6665#(<= ~counter~0 1)} assume true; {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,564 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6665#(<= ~counter~0 1)} {6665#(<= ~counter~0 1)} #63#return; {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {6665#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {6665#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6665#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:07,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {6665#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {6693#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,566 INFO L272 TraceCheckUtils]: 28: Hoare triple {6693#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {6693#(<= ~counter~0 2)} ~cond := #in~cond; {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {6693#(<= ~counter~0 2)} assume !(0 == ~cond); {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {6693#(<= ~counter~0 2)} assume true; {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,568 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6693#(<= ~counter~0 2)} {6693#(<= ~counter~0 2)} #63#return; {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {6693#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {6693#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6693#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:07,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {6693#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {6721#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,569 INFO L272 TraceCheckUtils]: 37: Hoare triple {6721#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {6721#(<= ~counter~0 3)} ~cond := #in~cond; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {6721#(<= ~counter~0 3)} assume !(0 == ~cond); {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(<= ~counter~0 3)} assume true; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,571 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6721#(<= ~counter~0 3)} {6721#(<= ~counter~0 3)} #63#return; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {6721#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {6721#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6721#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:07,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {6721#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {6749#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,572 INFO L272 TraceCheckUtils]: 46: Hoare triple {6749#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {6749#(<= ~counter~0 4)} ~cond := #in~cond; {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {6749#(<= ~counter~0 4)} assume !(0 == ~cond); {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {6749#(<= ~counter~0 4)} assume true; {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,574 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6749#(<= ~counter~0 4)} {6749#(<= ~counter~0 4)} #63#return; {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {6749#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {6749#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6749#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:07,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {6749#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {6777#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,575 INFO L272 TraceCheckUtils]: 55: Hoare triple {6777#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {6777#(<= ~counter~0 5)} ~cond := #in~cond; {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {6777#(<= ~counter~0 5)} assume !(0 == ~cond); {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {6777#(<= ~counter~0 5)} assume true; {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,577 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6777#(<= ~counter~0 5)} {6777#(<= ~counter~0 5)} #63#return; {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {6777#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {6777#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6777#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:07,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {6777#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,578 INFO L290 TraceCheckUtils]: 63: Hoare triple {6805#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,578 INFO L272 TraceCheckUtils]: 64: Hoare triple {6805#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {6805#(<= ~counter~0 6)} ~cond := #in~cond; {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {6805#(<= ~counter~0 6)} assume !(0 == ~cond); {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,579 INFO L290 TraceCheckUtils]: 67: Hoare triple {6805#(<= ~counter~0 6)} assume true; {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,580 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6805#(<= ~counter~0 6)} {6805#(<= ~counter~0 6)} #63#return; {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,580 INFO L290 TraceCheckUtils]: 69: Hoare triple {6805#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,580 INFO L290 TraceCheckUtils]: 70: Hoare triple {6805#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6805#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:07,581 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {6833#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,581 INFO L272 TraceCheckUtils]: 73: Hoare triple {6833#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {6833#(<= ~counter~0 7)} ~cond := #in~cond; {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {6833#(<= ~counter~0 7)} assume !(0 == ~cond); {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {6833#(<= ~counter~0 7)} assume true; {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,583 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6833#(<= ~counter~0 7)} {6833#(<= ~counter~0 7)} #63#return; {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {6833#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,583 INFO L290 TraceCheckUtils]: 79: Hoare triple {6833#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6833#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:07,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {6833#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {6861#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,584 INFO L272 TraceCheckUtils]: 82: Hoare triple {6861#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {6861#(<= ~counter~0 8)} ~cond := #in~cond; {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {6861#(<= ~counter~0 8)} assume !(0 == ~cond); {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {6861#(<= ~counter~0 8)} assume true; {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,586 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6861#(<= ~counter~0 8)} {6861#(<= ~counter~0 8)} #63#return; {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,586 INFO L290 TraceCheckUtils]: 87: Hoare triple {6861#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {6861#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6861#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:07,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {6861#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6889#(<= |main_#t~post6| 8)} is VALID [2022-04-28 13:57:07,587 INFO L290 TraceCheckUtils]: 90: Hoare triple {6889#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {6609#false} is VALID [2022-04-28 13:57:07,587 INFO L272 TraceCheckUtils]: 91: Hoare triple {6609#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {6609#false} is VALID [2022-04-28 13:57:07,587 INFO L290 TraceCheckUtils]: 92: Hoare triple {6609#false} ~cond := #in~cond; {6609#false} is VALID [2022-04-28 13:57:07,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {6609#false} assume 0 == ~cond; {6609#false} is VALID [2022-04-28 13:57:07,587 INFO L290 TraceCheckUtils]: 94: Hoare triple {6609#false} assume !false; {6609#false} is VALID [2022-04-28 13:57:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:07,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:08,054 INFO L290 TraceCheckUtils]: 94: Hoare triple {6609#false} assume !false; {6609#false} is VALID [2022-04-28 13:57:08,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {6609#false} assume 0 == ~cond; {6609#false} is VALID [2022-04-28 13:57:08,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {6609#false} ~cond := #in~cond; {6609#false} is VALID [2022-04-28 13:57:08,055 INFO L272 TraceCheckUtils]: 91: Hoare triple {6609#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {6609#false} is VALID [2022-04-28 13:57:08,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {6917#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {6609#false} is VALID [2022-04-28 13:57:08,055 INFO L290 TraceCheckUtils]: 89: Hoare triple {6921#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6917#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:08,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {6921#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6921#(< ~counter~0 20)} is VALID [2022-04-28 13:57:08,056 INFO L290 TraceCheckUtils]: 87: Hoare triple {6921#(< ~counter~0 20)} assume !!(0 != ~y3~0); {6921#(< ~counter~0 20)} is VALID [2022-04-28 13:57:08,056 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6608#true} {6921#(< ~counter~0 20)} #63#return; {6921#(< ~counter~0 20)} is VALID [2022-04-28 13:57:08,056 INFO L290 TraceCheckUtils]: 85: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,057 INFO L272 TraceCheckUtils]: 82: Hoare triple {6921#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {6921#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {6921#(< ~counter~0 20)} is VALID [2022-04-28 13:57:08,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {6949#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6921#(< ~counter~0 20)} is VALID [2022-04-28 13:57:08,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {6949#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6949#(< ~counter~0 19)} is VALID [2022-04-28 13:57:08,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {6949#(< ~counter~0 19)} assume !!(0 != ~y3~0); {6949#(< ~counter~0 19)} is VALID [2022-04-28 13:57:08,058 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6608#true} {6949#(< ~counter~0 19)} #63#return; {6949#(< ~counter~0 19)} is VALID [2022-04-28 13:57:08,059 INFO L290 TraceCheckUtils]: 76: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,059 INFO L272 TraceCheckUtils]: 73: Hoare triple {6949#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {6949#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {6949#(< ~counter~0 19)} is VALID [2022-04-28 13:57:08,059 INFO L290 TraceCheckUtils]: 71: Hoare triple {6977#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6949#(< ~counter~0 19)} is VALID [2022-04-28 13:57:08,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {6977#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {6977#(< ~counter~0 18)} is VALID [2022-04-28 13:57:08,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {6977#(< ~counter~0 18)} assume !!(0 != ~y3~0); {6977#(< ~counter~0 18)} is VALID [2022-04-28 13:57:08,060 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6608#true} {6977#(< ~counter~0 18)} #63#return; {6977#(< ~counter~0 18)} is VALID [2022-04-28 13:57:08,060 INFO L290 TraceCheckUtils]: 67: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,060 INFO L290 TraceCheckUtils]: 66: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,061 INFO L272 TraceCheckUtils]: 64: Hoare triple {6977#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {6977#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {6977#(< ~counter~0 18)} is VALID [2022-04-28 13:57:08,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {7005#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6977#(< ~counter~0 18)} is VALID [2022-04-28 13:57:08,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {7005#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7005#(< ~counter~0 17)} is VALID [2022-04-28 13:57:08,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {7005#(< ~counter~0 17)} assume !!(0 != ~y3~0); {7005#(< ~counter~0 17)} is VALID [2022-04-28 13:57:08,062 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6608#true} {7005#(< ~counter~0 17)} #63#return; {7005#(< ~counter~0 17)} is VALID [2022-04-28 13:57:08,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,063 INFO L272 TraceCheckUtils]: 55: Hoare triple {7005#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {7005#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {7005#(< ~counter~0 17)} is VALID [2022-04-28 13:57:08,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {7033#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7005#(< ~counter~0 17)} is VALID [2022-04-28 13:57:08,063 INFO L290 TraceCheckUtils]: 52: Hoare triple {7033#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7033#(< ~counter~0 16)} is VALID [2022-04-28 13:57:08,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {7033#(< ~counter~0 16)} assume !!(0 != ~y3~0); {7033#(< ~counter~0 16)} is VALID [2022-04-28 13:57:08,064 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6608#true} {7033#(< ~counter~0 16)} #63#return; {7033#(< ~counter~0 16)} is VALID [2022-04-28 13:57:08,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,064 INFO L272 TraceCheckUtils]: 46: Hoare triple {7033#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {7033#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {7033#(< ~counter~0 16)} is VALID [2022-04-28 13:57:08,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {7061#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7033#(< ~counter~0 16)} is VALID [2022-04-28 13:57:08,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {7061#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7061#(< ~counter~0 15)} is VALID [2022-04-28 13:57:08,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {7061#(< ~counter~0 15)} assume !!(0 != ~y3~0); {7061#(< ~counter~0 15)} is VALID [2022-04-28 13:57:08,066 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6608#true} {7061#(< ~counter~0 15)} #63#return; {7061#(< ~counter~0 15)} is VALID [2022-04-28 13:57:08,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,066 INFO L272 TraceCheckUtils]: 37: Hoare triple {7061#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {7061#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {7061#(< ~counter~0 15)} is VALID [2022-04-28 13:57:08,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {7089#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7061#(< ~counter~0 15)} is VALID [2022-04-28 13:57:08,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {7089#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7089#(< ~counter~0 14)} is VALID [2022-04-28 13:57:08,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {7089#(< ~counter~0 14)} assume !!(0 != ~y3~0); {7089#(< ~counter~0 14)} is VALID [2022-04-28 13:57:08,068 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6608#true} {7089#(< ~counter~0 14)} #63#return; {7089#(< ~counter~0 14)} is VALID [2022-04-28 13:57:08,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,068 INFO L272 TraceCheckUtils]: 28: Hoare triple {7089#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {7089#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {7089#(< ~counter~0 14)} is VALID [2022-04-28 13:57:08,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {7117#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7089#(< ~counter~0 14)} is VALID [2022-04-28 13:57:08,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {7117#(< ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7117#(< ~counter~0 13)} is VALID [2022-04-28 13:57:08,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {7117#(< ~counter~0 13)} assume !!(0 != ~y3~0); {7117#(< ~counter~0 13)} is VALID [2022-04-28 13:57:08,070 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6608#true} {7117#(< ~counter~0 13)} #63#return; {7117#(< ~counter~0 13)} is VALID [2022-04-28 13:57:08,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {7117#(< ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {7117#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {7117#(< ~counter~0 13)} is VALID [2022-04-28 13:57:08,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {7145#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7117#(< ~counter~0 13)} is VALID [2022-04-28 13:57:08,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {7145#(< ~counter~0 12)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,072 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6608#true} {7145#(< ~counter~0 12)} #61#return; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {7145#(< ~counter~0 12)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6608#true} {7145#(< ~counter~0 12)} #59#return; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {6608#true} assume true; {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {6608#true} assume !(0 == ~cond); {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {6608#true} ~cond := #in~cond; {6608#true} is VALID [2022-04-28 13:57:08,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {7145#(< ~counter~0 12)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {6608#true} is VALID [2022-04-28 13:57:08,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {7145#(< ~counter~0 12)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {7145#(< ~counter~0 12)} call #t~ret7 := main(); {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7145#(< ~counter~0 12)} {6608#true} #67#return; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {7145#(< ~counter~0 12)} assume true; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {6608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7145#(< ~counter~0 12)} is VALID [2022-04-28 13:57:08,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {6608#true} call ULTIMATE.init(); {6608#true} is VALID [2022-04-28 13:57:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 13:57:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:08,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053592365] [2022-04-28 13:57:08,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:08,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315799395] [2022-04-28 13:57:08,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315799395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:08,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:08,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 13:57:08,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:08,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [792597307] [2022-04-28 13:57:08,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [792597307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:08,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:08,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 13:57:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918717295] [2022-04-28 13:57:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 13:57:08,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:08,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:57:08,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:08,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 13:57:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:08,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 13:57:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 13:57:08,140 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:57:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:08,476 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-04-28 13:57:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 13:57:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 13:57:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:57:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 13:57:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:57:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 13:57:08,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2022-04-28 13:57:08,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:08,578 INFO L225 Difference]: With dead ends: 106 [2022-04-28 13:57:08,578 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 13:57:08,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-28 13:57:08,579 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 146 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 13:57:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 13:57:08,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:08,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:57:08,692 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:57:08,693 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:57:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:08,696 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 13:57:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 13:57:08,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:08,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:08,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 13:57:08,698 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 13:57:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:08,701 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 13:57:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 13:57:08,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:08,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:08,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:08,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 13:57:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 13:57:08,709 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 95 [2022-04-28 13:57:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:08,710 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 13:57:08,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 13:57:08,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 13:57:08,815 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 13:57:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 13:57:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 13:57:08,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:08,816 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:08,832 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 13:57:09,017 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 13:57:09,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 17 times [2022-04-28 13:57:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:09,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197346224] [2022-04-28 13:57:09,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 18 times [2022-04-28 13:57:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:09,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424195562] [2022-04-28 13:57:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:09,030 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:09,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857065900] [2022-04-28 13:57:09,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:57:09,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:09,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:09,032 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 13:57:09,040 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 13:57:09,106 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 13:57:09,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:09,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 13:57:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:09,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:09,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {7831#true} call ULTIMATE.init(); {7831#true} is VALID [2022-04-28 13:57:09,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {7831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7839#(<= ~counter~0 0)} {7831#true} #67#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {7839#(<= ~counter~0 0)} call #t~ret7 := main(); {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {7839#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {7839#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {7839#(<= ~counter~0 0)} ~cond := #in~cond; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {7839#(<= ~counter~0 0)} assume !(0 == ~cond); {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7839#(<= ~counter~0 0)} {7839#(<= ~counter~0 0)} #59#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,624 INFO L272 TraceCheckUtils]: 11: Hoare triple {7839#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {7839#(<= ~counter~0 0)} ~cond := #in~cond; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {7839#(<= ~counter~0 0)} assume !(0 == ~cond); {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,625 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7839#(<= ~counter~0 0)} {7839#(<= ~counter~0 0)} #61#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {7839#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {7839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {7839#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {7888#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {7888#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {7888#(<= ~counter~0 1)} ~cond := #in~cond; {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {7888#(<= ~counter~0 1)} assume !(0 == ~cond); {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {7888#(<= ~counter~0 1)} assume true; {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,628 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7888#(<= ~counter~0 1)} {7888#(<= ~counter~0 1)} #63#return; {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {7888#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {7888#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {7888#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {7916#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,630 INFO L272 TraceCheckUtils]: 28: Hoare triple {7916#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {7916#(<= ~counter~0 2)} ~cond := #in~cond; {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {7916#(<= ~counter~0 2)} assume !(0 == ~cond); {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {7916#(<= ~counter~0 2)} assume true; {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,631 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7916#(<= ~counter~0 2)} {7916#(<= ~counter~0 2)} #63#return; {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {7916#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {7916#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:09,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {7916#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {7944#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,633 INFO L272 TraceCheckUtils]: 37: Hoare triple {7944#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {7944#(<= ~counter~0 3)} ~cond := #in~cond; {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {7944#(<= ~counter~0 3)} assume !(0 == ~cond); {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {7944#(<= ~counter~0 3)} assume true; {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,634 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7944#(<= ~counter~0 3)} {7944#(<= ~counter~0 3)} #63#return; {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {7944#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {7944#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:09,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {7944#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {7972#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,636 INFO L272 TraceCheckUtils]: 46: Hoare triple {7972#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {7972#(<= ~counter~0 4)} ~cond := #in~cond; {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {7972#(<= ~counter~0 4)} assume !(0 == ~cond); {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {7972#(<= ~counter~0 4)} assume true; {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,637 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7972#(<= ~counter~0 4)} {7972#(<= ~counter~0 4)} #63#return; {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {7972#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {7972#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {7972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:09,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {7972#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {8000#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,639 INFO L272 TraceCheckUtils]: 55: Hoare triple {8000#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {8000#(<= ~counter~0 5)} ~cond := #in~cond; {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {8000#(<= ~counter~0 5)} assume !(0 == ~cond); {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,640 INFO L290 TraceCheckUtils]: 58: Hoare triple {8000#(<= ~counter~0 5)} assume true; {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,640 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8000#(<= ~counter~0 5)} {8000#(<= ~counter~0 5)} #63#return; {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,640 INFO L290 TraceCheckUtils]: 60: Hoare triple {8000#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {8000#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:09,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {8000#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {8028#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,642 INFO L272 TraceCheckUtils]: 64: Hoare triple {8028#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {8028#(<= ~counter~0 6)} ~cond := #in~cond; {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {8028#(<= ~counter~0 6)} assume !(0 == ~cond); {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {8028#(<= ~counter~0 6)} assume true; {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,643 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8028#(<= ~counter~0 6)} {8028#(<= ~counter~0 6)} #63#return; {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {8028#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {8028#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:09,644 INFO L290 TraceCheckUtils]: 71: Hoare triple {8028#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,644 INFO L290 TraceCheckUtils]: 72: Hoare triple {8056#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,645 INFO L272 TraceCheckUtils]: 73: Hoare triple {8056#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {8056#(<= ~counter~0 7)} ~cond := #in~cond; {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {8056#(<= ~counter~0 7)} assume !(0 == ~cond); {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {8056#(<= ~counter~0 7)} assume true; {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,646 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8056#(<= ~counter~0 7)} {8056#(<= ~counter~0 7)} #63#return; {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {8056#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,647 INFO L290 TraceCheckUtils]: 79: Hoare triple {8056#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:09,647 INFO L290 TraceCheckUtils]: 80: Hoare triple {8056#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {8084#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,648 INFO L272 TraceCheckUtils]: 82: Hoare triple {8084#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {8084#(<= ~counter~0 8)} ~cond := #in~cond; {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,649 INFO L290 TraceCheckUtils]: 84: Hoare triple {8084#(<= ~counter~0 8)} assume !(0 == ~cond); {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,649 INFO L290 TraceCheckUtils]: 85: Hoare triple {8084#(<= ~counter~0 8)} assume true; {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,649 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8084#(<= ~counter~0 8)} {8084#(<= ~counter~0 8)} #63#return; {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,650 INFO L290 TraceCheckUtils]: 87: Hoare triple {8084#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,650 INFO L290 TraceCheckUtils]: 88: Hoare triple {8084#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:09,650 INFO L290 TraceCheckUtils]: 89: Hoare triple {8084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {8112#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,651 INFO L272 TraceCheckUtils]: 91: Hoare triple {8112#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {8112#(<= ~counter~0 9)} ~cond := #in~cond; {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {8112#(<= ~counter~0 9)} assume !(0 == ~cond); {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,652 INFO L290 TraceCheckUtils]: 94: Hoare triple {8112#(<= ~counter~0 9)} assume true; {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,653 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8112#(<= ~counter~0 9)} {8112#(<= ~counter~0 9)} #63#return; {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {8112#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,653 INFO L290 TraceCheckUtils]: 97: Hoare triple {8112#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:09,653 INFO L290 TraceCheckUtils]: 98: Hoare triple {8112#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8140#(<= |main_#t~post6| 9)} is VALID [2022-04-28 13:57:09,654 INFO L290 TraceCheckUtils]: 99: Hoare triple {8140#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {7832#false} is VALID [2022-04-28 13:57:09,654 INFO L272 TraceCheckUtils]: 100: Hoare triple {7832#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7832#false} is VALID [2022-04-28 13:57:09,654 INFO L290 TraceCheckUtils]: 101: Hoare triple {7832#false} ~cond := #in~cond; {7832#false} is VALID [2022-04-28 13:57:09,654 INFO L290 TraceCheckUtils]: 102: Hoare triple {7832#false} assume 0 == ~cond; {7832#false} is VALID [2022-04-28 13:57:09,654 INFO L290 TraceCheckUtils]: 103: Hoare triple {7832#false} assume !false; {7832#false} is VALID [2022-04-28 13:57:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:09,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:10,225 INFO L290 TraceCheckUtils]: 103: Hoare triple {7832#false} assume !false; {7832#false} is VALID [2022-04-28 13:57:10,226 INFO L290 TraceCheckUtils]: 102: Hoare triple {7832#false} assume 0 == ~cond; {7832#false} is VALID [2022-04-28 13:57:10,226 INFO L290 TraceCheckUtils]: 101: Hoare triple {7832#false} ~cond := #in~cond; {7832#false} is VALID [2022-04-28 13:57:10,226 INFO L272 TraceCheckUtils]: 100: Hoare triple {7832#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {7832#false} is VALID [2022-04-28 13:57:10,226 INFO L290 TraceCheckUtils]: 99: Hoare triple {8168#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {7832#false} is VALID [2022-04-28 13:57:10,226 INFO L290 TraceCheckUtils]: 98: Hoare triple {8172#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8168#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:10,227 INFO L290 TraceCheckUtils]: 97: Hoare triple {8172#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8172#(< ~counter~0 20)} is VALID [2022-04-28 13:57:10,227 INFO L290 TraceCheckUtils]: 96: Hoare triple {8172#(< ~counter~0 20)} assume !!(0 != ~y3~0); {8172#(< ~counter~0 20)} is VALID [2022-04-28 13:57:10,228 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7831#true} {8172#(< ~counter~0 20)} #63#return; {8172#(< ~counter~0 20)} is VALID [2022-04-28 13:57:10,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,228 INFO L272 TraceCheckUtils]: 91: Hoare triple {8172#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {8172#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {8172#(< ~counter~0 20)} is VALID [2022-04-28 13:57:10,229 INFO L290 TraceCheckUtils]: 89: Hoare triple {8200#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8172#(< ~counter~0 20)} is VALID [2022-04-28 13:57:10,229 INFO L290 TraceCheckUtils]: 88: Hoare triple {8200#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8200#(< ~counter~0 19)} is VALID [2022-04-28 13:57:10,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {8200#(< ~counter~0 19)} assume !!(0 != ~y3~0); {8200#(< ~counter~0 19)} is VALID [2022-04-28 13:57:10,230 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7831#true} {8200#(< ~counter~0 19)} #63#return; {8200#(< ~counter~0 19)} is VALID [2022-04-28 13:57:10,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,230 INFO L272 TraceCheckUtils]: 82: Hoare triple {8200#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,231 INFO L290 TraceCheckUtils]: 81: Hoare triple {8200#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {8200#(< ~counter~0 19)} is VALID [2022-04-28 13:57:10,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {8228#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8200#(< ~counter~0 19)} is VALID [2022-04-28 13:57:10,231 INFO L290 TraceCheckUtils]: 79: Hoare triple {8228#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8228#(< ~counter~0 18)} is VALID [2022-04-28 13:57:10,232 INFO L290 TraceCheckUtils]: 78: Hoare triple {8228#(< ~counter~0 18)} assume !!(0 != ~y3~0); {8228#(< ~counter~0 18)} is VALID [2022-04-28 13:57:10,232 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7831#true} {8228#(< ~counter~0 18)} #63#return; {8228#(< ~counter~0 18)} is VALID [2022-04-28 13:57:10,232 INFO L290 TraceCheckUtils]: 76: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,232 INFO L290 TraceCheckUtils]: 75: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,232 INFO L290 TraceCheckUtils]: 74: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,232 INFO L272 TraceCheckUtils]: 73: Hoare triple {8228#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,233 INFO L290 TraceCheckUtils]: 72: Hoare triple {8228#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {8228#(< ~counter~0 18)} is VALID [2022-04-28 13:57:10,233 INFO L290 TraceCheckUtils]: 71: Hoare triple {8256#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8228#(< ~counter~0 18)} is VALID [2022-04-28 13:57:10,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {8256#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8256#(< ~counter~0 17)} is VALID [2022-04-28 13:57:10,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {8256#(< ~counter~0 17)} assume !!(0 != ~y3~0); {8256#(< ~counter~0 17)} is VALID [2022-04-28 13:57:10,234 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7831#true} {8256#(< ~counter~0 17)} #63#return; {8256#(< ~counter~0 17)} is VALID [2022-04-28 13:57:10,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,234 INFO L272 TraceCheckUtils]: 64: Hoare triple {8256#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {8256#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {8256#(< ~counter~0 17)} is VALID [2022-04-28 13:57:10,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {8284#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8256#(< ~counter~0 17)} is VALID [2022-04-28 13:57:10,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {8284#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8284#(< ~counter~0 16)} is VALID [2022-04-28 13:57:10,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {8284#(< ~counter~0 16)} assume !!(0 != ~y3~0); {8284#(< ~counter~0 16)} is VALID [2022-04-28 13:57:10,240 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7831#true} {8284#(< ~counter~0 16)} #63#return; {8284#(< ~counter~0 16)} is VALID [2022-04-28 13:57:10,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,240 INFO L272 TraceCheckUtils]: 55: Hoare triple {8284#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {8284#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {8284#(< ~counter~0 16)} is VALID [2022-04-28 13:57:10,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {8312#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8284#(< ~counter~0 16)} is VALID [2022-04-28 13:57:10,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {8312#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8312#(< ~counter~0 15)} is VALID [2022-04-28 13:57:10,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {8312#(< ~counter~0 15)} assume !!(0 != ~y3~0); {8312#(< ~counter~0 15)} is VALID [2022-04-28 13:57:10,242 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7831#true} {8312#(< ~counter~0 15)} #63#return; {8312#(< ~counter~0 15)} is VALID [2022-04-28 13:57:10,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,242 INFO L272 TraceCheckUtils]: 46: Hoare triple {8312#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {8312#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {8312#(< ~counter~0 15)} is VALID [2022-04-28 13:57:10,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {8340#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8312#(< ~counter~0 15)} is VALID [2022-04-28 13:57:10,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8340#(< ~counter~0 14)} is VALID [2022-04-28 13:57:10,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#(< ~counter~0 14)} assume !!(0 != ~y3~0); {8340#(< ~counter~0 14)} is VALID [2022-04-28 13:57:10,244 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7831#true} {8340#(< ~counter~0 14)} #63#return; {8340#(< ~counter~0 14)} is VALID [2022-04-28 13:57:10,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,244 INFO L272 TraceCheckUtils]: 37: Hoare triple {8340#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {8340#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {8340#(< ~counter~0 14)} is VALID [2022-04-28 13:57:10,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {8368#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8340#(< ~counter~0 14)} is VALID [2022-04-28 13:57:10,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {8368#(< ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8368#(< ~counter~0 13)} is VALID [2022-04-28 13:57:10,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {8368#(< ~counter~0 13)} assume !!(0 != ~y3~0); {8368#(< ~counter~0 13)} is VALID [2022-04-28 13:57:10,248 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7831#true} {8368#(< ~counter~0 13)} #63#return; {8368#(< ~counter~0 13)} is VALID [2022-04-28 13:57:10,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,248 INFO L272 TraceCheckUtils]: 28: Hoare triple {8368#(< ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {8368#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {8368#(< ~counter~0 13)} is VALID [2022-04-28 13:57:10,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {8396#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8368#(< ~counter~0 13)} is VALID [2022-04-28 13:57:10,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {8396#(< ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {8396#(< ~counter~0 12)} is VALID [2022-04-28 13:57:10,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {8396#(< ~counter~0 12)} assume !!(0 != ~y3~0); {8396#(< ~counter~0 12)} is VALID [2022-04-28 13:57:10,253 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7831#true} {8396#(< ~counter~0 12)} #63#return; {8396#(< ~counter~0 12)} is VALID [2022-04-28 13:57:10,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,253 INFO L272 TraceCheckUtils]: 19: Hoare triple {8396#(< ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {8396#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {8396#(< ~counter~0 12)} is VALID [2022-04-28 13:57:10,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {8424#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8396#(< ~counter~0 12)} is VALID [2022-04-28 13:57:10,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {8424#(< ~counter~0 11)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,255 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7831#true} {8424#(< ~counter~0 11)} #61#return; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,255 INFO L272 TraceCheckUtils]: 11: Hoare triple {8424#(< ~counter~0 11)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7831#true} {8424#(< ~counter~0 11)} #59#return; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-28 13:57:10,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-28 13:57:10,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-28 13:57:10,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {8424#(< ~counter~0 11)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {7831#true} is VALID [2022-04-28 13:57:10,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {8424#(< ~counter~0 11)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {8424#(< ~counter~0 11)} call #t~ret7 := main(); {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8424#(< ~counter~0 11)} {7831#true} #67#return; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {8424#(< ~counter~0 11)} assume true; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {7831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8424#(< ~counter~0 11)} is VALID [2022-04-28 13:57:10,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {7831#true} call ULTIMATE.init(); {7831#true} is VALID [2022-04-28 13:57:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 13:57:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424195562] [2022-04-28 13:57:10,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857065900] [2022-04-28 13:57:10,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857065900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:10,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:10,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 13:57:10,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:10,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197346224] [2022-04-28 13:57:10,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197346224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:10,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:10,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 13:57:10,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295777372] [2022-04-28 13:57:10,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 13:57:10,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:10,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:57:10,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:10,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 13:57:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 13:57:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:10,338 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:57:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:10,675 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2022-04-28 13:57:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 13:57:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 13:57:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:57:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 13:57:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:57:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 13:57:10,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 125 transitions. [2022-04-28 13:57:10,778 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 13:57:10,779 INFO L225 Difference]: With dead ends: 115 [2022-04-28 13:57:10,779 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 13:57:10,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 13:57:10,781 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:10,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 13:57:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 13:57:10,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:10,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:57:10,878 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:57:10,878 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:57:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:10,880 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 13:57:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 13:57:10,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:10,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:10,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 13:57:10,881 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 13:57:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:10,883 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 13:57:10,883 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 13:57:10,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:10,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:10,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:10,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 13:57:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-28 13:57:10,886 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 104 [2022-04-28 13:57:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:10,886 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-28 13:57:10,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 13:57:10,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 121 transitions. [2022-04-28 13:57:11,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:11,013 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 13:57:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 13:57:11,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:11,014 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:11,031 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 13:57:11,219 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 13:57:11,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 19 times [2022-04-28 13:57:11,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:11,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432972863] [2022-04-28 13:57:11,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 20 times [2022-04-28 13:57:11,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:11,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597903342] [2022-04-28 13:57:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:11,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:11,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552671681] [2022-04-28 13:57:11,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:11,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:11,252 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 13:57:11,253 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 13:57:11,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:11,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:11,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 13:57:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:11,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:11,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {9166#true} call ULTIMATE.init(); {9166#true} is VALID [2022-04-28 13:57:11,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {9166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {9174#(<= ~counter~0 0)} assume true; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9174#(<= ~counter~0 0)} {9166#true} #67#return; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {9174#(<= ~counter~0 0)} call #t~ret7 := main(); {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {9174#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {9174#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {9174#(<= ~counter~0 0)} ~cond := #in~cond; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {9174#(<= ~counter~0 0)} assume !(0 == ~cond); {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {9174#(<= ~counter~0 0)} assume true; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9174#(<= ~counter~0 0)} {9174#(<= ~counter~0 0)} #59#return; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {9174#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {9174#(<= ~counter~0 0)} ~cond := #in~cond; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {9174#(<= ~counter~0 0)} assume !(0 == ~cond); {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {9174#(<= ~counter~0 0)} assume true; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,951 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9174#(<= ~counter~0 0)} {9174#(<= ~counter~0 0)} #61#return; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {9174#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {9174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {9174#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {9223#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {9223#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {9223#(<= ~counter~0 1)} ~cond := #in~cond; {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {9223#(<= ~counter~0 1)} assume !(0 == ~cond); {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {9223#(<= ~counter~0 1)} assume true; {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,954 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9223#(<= ~counter~0 1)} {9223#(<= ~counter~0 1)} #63#return; {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {9223#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {9223#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {9223#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {9251#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,956 INFO L272 TraceCheckUtils]: 28: Hoare triple {9251#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {9251#(<= ~counter~0 2)} ~cond := #in~cond; {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {9251#(<= ~counter~0 2)} assume !(0 == ~cond); {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {9251#(<= ~counter~0 2)} assume true; {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,957 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9251#(<= ~counter~0 2)} {9251#(<= ~counter~0 2)} #63#return; {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {9251#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {9251#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {9251#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {9279#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,959 INFO L272 TraceCheckUtils]: 37: Hoare triple {9279#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {9279#(<= ~counter~0 3)} ~cond := #in~cond; {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {9279#(<= ~counter~0 3)} assume !(0 == ~cond); {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {9279#(<= ~counter~0 3)} assume true; {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,960 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9279#(<= ~counter~0 3)} {9279#(<= ~counter~0 3)} #63#return; {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {9279#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {9279#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {9279#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {9307#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,962 INFO L272 TraceCheckUtils]: 46: Hoare triple {9307#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {9307#(<= ~counter~0 4)} ~cond := #in~cond; {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {9307#(<= ~counter~0 4)} assume !(0 == ~cond); {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {9307#(<= ~counter~0 4)} assume true; {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,963 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9307#(<= ~counter~0 4)} {9307#(<= ~counter~0 4)} #63#return; {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {9307#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {9307#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:11,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {9307#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {9335#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,965 INFO L272 TraceCheckUtils]: 55: Hoare triple {9335#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {9335#(<= ~counter~0 5)} ~cond := #in~cond; {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {9335#(<= ~counter~0 5)} assume !(0 == ~cond); {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {9335#(<= ~counter~0 5)} assume true; {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,966 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9335#(<= ~counter~0 5)} {9335#(<= ~counter~0 5)} #63#return; {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {9335#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {9335#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:11,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {9335#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {9363#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,968 INFO L272 TraceCheckUtils]: 64: Hoare triple {9363#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {9363#(<= ~counter~0 6)} ~cond := #in~cond; {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {9363#(<= ~counter~0 6)} assume !(0 == ~cond); {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,969 INFO L290 TraceCheckUtils]: 67: Hoare triple {9363#(<= ~counter~0 6)} assume true; {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,969 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9363#(<= ~counter~0 6)} {9363#(<= ~counter~0 6)} #63#return; {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {9363#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {9363#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:11,970 INFO L290 TraceCheckUtils]: 71: Hoare triple {9363#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {9391#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,971 INFO L272 TraceCheckUtils]: 73: Hoare triple {9391#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,971 INFO L290 TraceCheckUtils]: 74: Hoare triple {9391#(<= ~counter~0 7)} ~cond := #in~cond; {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,971 INFO L290 TraceCheckUtils]: 75: Hoare triple {9391#(<= ~counter~0 7)} assume !(0 == ~cond); {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,972 INFO L290 TraceCheckUtils]: 76: Hoare triple {9391#(<= ~counter~0 7)} assume true; {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,972 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9391#(<= ~counter~0 7)} {9391#(<= ~counter~0 7)} #63#return; {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,972 INFO L290 TraceCheckUtils]: 78: Hoare triple {9391#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,973 INFO L290 TraceCheckUtils]: 79: Hoare triple {9391#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:11,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {9391#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {9419#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,974 INFO L272 TraceCheckUtils]: 82: Hoare triple {9419#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {9419#(<= ~counter~0 8)} ~cond := #in~cond; {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {9419#(<= ~counter~0 8)} assume !(0 == ~cond); {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {9419#(<= ~counter~0 8)} assume true; {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,975 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9419#(<= ~counter~0 8)} {9419#(<= ~counter~0 8)} #63#return; {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,975 INFO L290 TraceCheckUtils]: 87: Hoare triple {9419#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {9419#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:11,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {9419#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {9447#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,977 INFO L272 TraceCheckUtils]: 91: Hoare triple {9447#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,977 INFO L290 TraceCheckUtils]: 92: Hoare triple {9447#(<= ~counter~0 9)} ~cond := #in~cond; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,977 INFO L290 TraceCheckUtils]: 93: Hoare triple {9447#(<= ~counter~0 9)} assume !(0 == ~cond); {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,978 INFO L290 TraceCheckUtils]: 94: Hoare triple {9447#(<= ~counter~0 9)} assume true; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,978 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9447#(<= ~counter~0 9)} {9447#(<= ~counter~0 9)} #63#return; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,978 INFO L290 TraceCheckUtils]: 96: Hoare triple {9447#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {9447#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:11,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {9447#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {9475#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,980 INFO L272 TraceCheckUtils]: 100: Hoare triple {9475#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,980 INFO L290 TraceCheckUtils]: 101: Hoare triple {9475#(<= ~counter~0 10)} ~cond := #in~cond; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,980 INFO L290 TraceCheckUtils]: 102: Hoare triple {9475#(<= ~counter~0 10)} assume !(0 == ~cond); {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,981 INFO L290 TraceCheckUtils]: 103: Hoare triple {9475#(<= ~counter~0 10)} assume true; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,981 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {9475#(<= ~counter~0 10)} {9475#(<= ~counter~0 10)} #63#return; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,982 INFO L290 TraceCheckUtils]: 105: Hoare triple {9475#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,982 INFO L290 TraceCheckUtils]: 106: Hoare triple {9475#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:11,982 INFO L290 TraceCheckUtils]: 107: Hoare triple {9475#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9503#(<= |main_#t~post6| 10)} is VALID [2022-04-28 13:57:11,982 INFO L290 TraceCheckUtils]: 108: Hoare triple {9503#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {9167#false} is VALID [2022-04-28 13:57:11,983 INFO L272 TraceCheckUtils]: 109: Hoare triple {9167#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {9167#false} is VALID [2022-04-28 13:57:11,983 INFO L290 TraceCheckUtils]: 110: Hoare triple {9167#false} ~cond := #in~cond; {9167#false} is VALID [2022-04-28 13:57:11,983 INFO L290 TraceCheckUtils]: 111: Hoare triple {9167#false} assume 0 == ~cond; {9167#false} is VALID [2022-04-28 13:57:11,983 INFO L290 TraceCheckUtils]: 112: Hoare triple {9167#false} assume !false; {9167#false} is VALID [2022-04-28 13:57:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:11,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:12,587 INFO L290 TraceCheckUtils]: 112: Hoare triple {9167#false} assume !false; {9167#false} is VALID [2022-04-28 13:57:12,587 INFO L290 TraceCheckUtils]: 111: Hoare triple {9167#false} assume 0 == ~cond; {9167#false} is VALID [2022-04-28 13:57:12,587 INFO L290 TraceCheckUtils]: 110: Hoare triple {9167#false} ~cond := #in~cond; {9167#false} is VALID [2022-04-28 13:57:12,587 INFO L272 TraceCheckUtils]: 109: Hoare triple {9167#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {9167#false} is VALID [2022-04-28 13:57:12,587 INFO L290 TraceCheckUtils]: 108: Hoare triple {9531#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {9167#false} is VALID [2022-04-28 13:57:12,587 INFO L290 TraceCheckUtils]: 107: Hoare triple {9535#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9531#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:12,588 INFO L290 TraceCheckUtils]: 106: Hoare triple {9535#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9535#(< ~counter~0 20)} is VALID [2022-04-28 13:57:12,588 INFO L290 TraceCheckUtils]: 105: Hoare triple {9535#(< ~counter~0 20)} assume !!(0 != ~y3~0); {9535#(< ~counter~0 20)} is VALID [2022-04-28 13:57:12,589 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {9166#true} {9535#(< ~counter~0 20)} #63#return; {9535#(< ~counter~0 20)} is VALID [2022-04-28 13:57:12,589 INFO L290 TraceCheckUtils]: 103: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,589 INFO L290 TraceCheckUtils]: 102: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,589 INFO L290 TraceCheckUtils]: 101: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,589 INFO L272 TraceCheckUtils]: 100: Hoare triple {9535#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,589 INFO L290 TraceCheckUtils]: 99: Hoare triple {9535#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {9535#(< ~counter~0 20)} is VALID [2022-04-28 13:57:12,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {9563#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9535#(< ~counter~0 20)} is VALID [2022-04-28 13:57:12,590 INFO L290 TraceCheckUtils]: 97: Hoare triple {9563#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9563#(< ~counter~0 19)} is VALID [2022-04-28 13:57:12,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {9563#(< ~counter~0 19)} assume !!(0 != ~y3~0); {9563#(< ~counter~0 19)} is VALID [2022-04-28 13:57:12,591 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9166#true} {9563#(< ~counter~0 19)} #63#return; {9563#(< ~counter~0 19)} is VALID [2022-04-28 13:57:12,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,591 INFO L290 TraceCheckUtils]: 93: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,591 INFO L290 TraceCheckUtils]: 92: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,591 INFO L272 TraceCheckUtils]: 91: Hoare triple {9563#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,591 INFO L290 TraceCheckUtils]: 90: Hoare triple {9563#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {9563#(< ~counter~0 19)} is VALID [2022-04-28 13:57:12,592 INFO L290 TraceCheckUtils]: 89: Hoare triple {9591#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9563#(< ~counter~0 19)} is VALID [2022-04-28 13:57:12,592 INFO L290 TraceCheckUtils]: 88: Hoare triple {9591#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9591#(< ~counter~0 18)} is VALID [2022-04-28 13:57:12,592 INFO L290 TraceCheckUtils]: 87: Hoare triple {9591#(< ~counter~0 18)} assume !!(0 != ~y3~0); {9591#(< ~counter~0 18)} is VALID [2022-04-28 13:57:12,593 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9166#true} {9591#(< ~counter~0 18)} #63#return; {9591#(< ~counter~0 18)} is VALID [2022-04-28 13:57:12,593 INFO L290 TraceCheckUtils]: 85: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,593 INFO L290 TraceCheckUtils]: 84: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,593 INFO L290 TraceCheckUtils]: 83: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,593 INFO L272 TraceCheckUtils]: 82: Hoare triple {9591#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,593 INFO L290 TraceCheckUtils]: 81: Hoare triple {9591#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {9591#(< ~counter~0 18)} is VALID [2022-04-28 13:57:12,594 INFO L290 TraceCheckUtils]: 80: Hoare triple {9619#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9591#(< ~counter~0 18)} is VALID [2022-04-28 13:57:12,594 INFO L290 TraceCheckUtils]: 79: Hoare triple {9619#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9619#(< ~counter~0 17)} is VALID [2022-04-28 13:57:12,594 INFO L290 TraceCheckUtils]: 78: Hoare triple {9619#(< ~counter~0 17)} assume !!(0 != ~y3~0); {9619#(< ~counter~0 17)} is VALID [2022-04-28 13:57:12,595 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9166#true} {9619#(< ~counter~0 17)} #63#return; {9619#(< ~counter~0 17)} is VALID [2022-04-28 13:57:12,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,595 INFO L272 TraceCheckUtils]: 73: Hoare triple {9619#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {9619#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {9619#(< ~counter~0 17)} is VALID [2022-04-28 13:57:12,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {9647#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9619#(< ~counter~0 17)} is VALID [2022-04-28 13:57:12,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {9647#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9647#(< ~counter~0 16)} is VALID [2022-04-28 13:57:12,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {9647#(< ~counter~0 16)} assume !!(0 != ~y3~0); {9647#(< ~counter~0 16)} is VALID [2022-04-28 13:57:12,597 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9166#true} {9647#(< ~counter~0 16)} #63#return; {9647#(< ~counter~0 16)} is VALID [2022-04-28 13:57:12,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,597 INFO L272 TraceCheckUtils]: 64: Hoare triple {9647#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {9647#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {9647#(< ~counter~0 16)} is VALID [2022-04-28 13:57:12,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {9675#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9647#(< ~counter~0 16)} is VALID [2022-04-28 13:57:12,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {9675#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9675#(< ~counter~0 15)} is VALID [2022-04-28 13:57:12,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {9675#(< ~counter~0 15)} assume !!(0 != ~y3~0); {9675#(< ~counter~0 15)} is VALID [2022-04-28 13:57:12,599 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9166#true} {9675#(< ~counter~0 15)} #63#return; {9675#(< ~counter~0 15)} is VALID [2022-04-28 13:57:12,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,599 INFO L272 TraceCheckUtils]: 55: Hoare triple {9675#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {9675#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {9675#(< ~counter~0 15)} is VALID [2022-04-28 13:57:12,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {9703#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9675#(< ~counter~0 15)} is VALID [2022-04-28 13:57:12,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {9703#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9703#(< ~counter~0 14)} is VALID [2022-04-28 13:57:12,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {9703#(< ~counter~0 14)} assume !!(0 != ~y3~0); {9703#(< ~counter~0 14)} is VALID [2022-04-28 13:57:12,601 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9166#true} {9703#(< ~counter~0 14)} #63#return; {9703#(< ~counter~0 14)} is VALID [2022-04-28 13:57:12,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,601 INFO L272 TraceCheckUtils]: 46: Hoare triple {9703#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {9703#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {9703#(< ~counter~0 14)} is VALID [2022-04-28 13:57:12,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {9731#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9703#(< ~counter~0 14)} is VALID [2022-04-28 13:57:12,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {9731#(< ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9731#(< ~counter~0 13)} is VALID [2022-04-28 13:57:12,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {9731#(< ~counter~0 13)} assume !!(0 != ~y3~0); {9731#(< ~counter~0 13)} is VALID [2022-04-28 13:57:12,603 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9166#true} {9731#(< ~counter~0 13)} #63#return; {9731#(< ~counter~0 13)} is VALID [2022-04-28 13:57:12,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,603 INFO L272 TraceCheckUtils]: 37: Hoare triple {9731#(< ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {9731#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {9731#(< ~counter~0 13)} is VALID [2022-04-28 13:57:12,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {9759#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9731#(< ~counter~0 13)} is VALID [2022-04-28 13:57:12,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {9759#(< ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9759#(< ~counter~0 12)} is VALID [2022-04-28 13:57:12,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {9759#(< ~counter~0 12)} assume !!(0 != ~y3~0); {9759#(< ~counter~0 12)} is VALID [2022-04-28 13:57:12,605 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9166#true} {9759#(< ~counter~0 12)} #63#return; {9759#(< ~counter~0 12)} is VALID [2022-04-28 13:57:12,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,605 INFO L272 TraceCheckUtils]: 28: Hoare triple {9759#(< ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {9759#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {9759#(< ~counter~0 12)} is VALID [2022-04-28 13:57:12,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {9475#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9759#(< ~counter~0 12)} is VALID [2022-04-28 13:57:12,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {9475#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:12,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {9475#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:12,607 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9166#true} {9475#(<= ~counter~0 10)} #63#return; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:12,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {9475#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {9475#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:12,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {9447#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:12,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {9447#(<= ~counter~0 9)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9166#true} {9447#(<= ~counter~0 9)} #61#return; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {9447#(<= ~counter~0 9)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,610 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9166#true} {9447#(<= ~counter~0 9)} #59#return; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {9166#true} assume true; {9166#true} is VALID [2022-04-28 13:57:12,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {9166#true} assume !(0 == ~cond); {9166#true} is VALID [2022-04-28 13:57:12,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {9166#true} ~cond := #in~cond; {9166#true} is VALID [2022-04-28 13:57:12,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {9447#(<= ~counter~0 9)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {9166#true} is VALID [2022-04-28 13:57:12,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {9447#(<= ~counter~0 9)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {9447#(<= ~counter~0 9)} call #t~ret7 := main(); {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9447#(<= ~counter~0 9)} {9166#true} #67#return; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {9447#(<= ~counter~0 9)} assume true; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {9166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:12,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {9166#true} call ULTIMATE.init(); {9166#true} is VALID [2022-04-28 13:57:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 13:57:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:12,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597903342] [2022-04-28 13:57:12,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:12,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552671681] [2022-04-28 13:57:12,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552671681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:12,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:12,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 13:57:12,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:12,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432972863] [2022-04-28 13:57:12,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432972863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:12,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:12,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 13:57:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077149057] [2022-04-28 13:57:12,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:12,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 113 [2022-04-28 13:57:12,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:12,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 13:57:12,694 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 13:57:12,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 13:57:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 13:57:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:12,695 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 13:57:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:13,067 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2022-04-28 13:57:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 13:57:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 113 [2022-04-28 13:57:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 13:57:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2022-04-28 13:57:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 13:57:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2022-04-28 13:57:13,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 135 transitions. [2022-04-28 13:57:13,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:13,165 INFO L225 Difference]: With dead ends: 124 [2022-04-28 13:57:13,165 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 13:57:13,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 13:57:13,166 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:13,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 162 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 13:57:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-28 13:57:13,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:13,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 13:57:13,299 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 13:57:13,299 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 13:57:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:13,301 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-04-28 13:57:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-28 13:57:13,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:13,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:13,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 119 states. [2022-04-28 13:57:13,302 INFO L87 Difference]: Start difference. First operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 119 states. [2022-04-28 13:57:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:13,305 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-04-28 13:57:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-28 13:57:13,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:13,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:13,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:13,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 13:57:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2022-04-28 13:57:13,308 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 113 [2022-04-28 13:57:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:13,308 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2022-04-28 13:57:13,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 13:57:13,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 131 transitions. [2022-04-28 13:57:13,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-28 13:57:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 13:57:13,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:13,464 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:13,491 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 13:57:13,665 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 13:57:13,665 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1999651676, now seen corresponding path program 21 times [2022-04-28 13:57:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:13,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811220522] [2022-04-28 13:57:13,666 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1999651676, now seen corresponding path program 22 times [2022-04-28 13:57:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:13,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38737656] [2022-04-28 13:57:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:13,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:13,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533518687] [2022-04-28 13:57:13,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:13,690 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 13:57:13,691 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 13:57:13,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:13,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:13,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 13:57:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:13,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:14,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {10611#true} call ULTIMATE.init(); {10611#true} is VALID [2022-04-28 13:57:14,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {10611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {10619#(<= ~counter~0 0)} assume true; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10619#(<= ~counter~0 0)} {10611#true} #67#return; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {10619#(<= ~counter~0 0)} call #t~ret7 := main(); {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {10619#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {10619#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {10619#(<= ~counter~0 0)} ~cond := #in~cond; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {10619#(<= ~counter~0 0)} assume !(0 == ~cond); {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {10619#(<= ~counter~0 0)} assume true; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10619#(<= ~counter~0 0)} {10619#(<= ~counter~0 0)} #59#return; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,375 INFO L272 TraceCheckUtils]: 11: Hoare triple {10619#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {10619#(<= ~counter~0 0)} ~cond := #in~cond; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {10619#(<= ~counter~0 0)} assume !(0 == ~cond); {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {10619#(<= ~counter~0 0)} assume true; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,376 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10619#(<= ~counter~0 0)} {10619#(<= ~counter~0 0)} #61#return; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {10619#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {10619#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:14,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {10619#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {10668#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,378 INFO L272 TraceCheckUtils]: 19: Hoare triple {10668#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {10668#(<= ~counter~0 1)} ~cond := #in~cond; {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {10668#(<= ~counter~0 1)} assume !(0 == ~cond); {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {10668#(<= ~counter~0 1)} assume true; {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,379 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10668#(<= ~counter~0 1)} {10668#(<= ~counter~0 1)} #63#return; {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {10668#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {10668#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10668#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:14,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {10668#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {10696#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,381 INFO L272 TraceCheckUtils]: 28: Hoare triple {10696#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {10696#(<= ~counter~0 2)} ~cond := #in~cond; {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {10696#(<= ~counter~0 2)} assume !(0 == ~cond); {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {10696#(<= ~counter~0 2)} assume true; {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,382 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10696#(<= ~counter~0 2)} {10696#(<= ~counter~0 2)} #63#return; {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {10696#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {10696#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10696#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:14,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {10696#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {10724#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,384 INFO L272 TraceCheckUtils]: 37: Hoare triple {10724#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {10724#(<= ~counter~0 3)} ~cond := #in~cond; {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {10724#(<= ~counter~0 3)} assume !(0 == ~cond); {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {10724#(<= ~counter~0 3)} assume true; {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,385 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10724#(<= ~counter~0 3)} {10724#(<= ~counter~0 3)} #63#return; {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {10724#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {10724#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10724#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:14,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {10724#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {10752#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,387 INFO L272 TraceCheckUtils]: 46: Hoare triple {10752#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {10752#(<= ~counter~0 4)} ~cond := #in~cond; {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {10752#(<= ~counter~0 4)} assume !(0 == ~cond); {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {10752#(<= ~counter~0 4)} assume true; {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,388 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10752#(<= ~counter~0 4)} {10752#(<= ~counter~0 4)} #63#return; {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {10752#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {10752#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10752#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:14,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {10752#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {10780#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,390 INFO L272 TraceCheckUtils]: 55: Hoare triple {10780#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {10780#(<= ~counter~0 5)} ~cond := #in~cond; {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {10780#(<= ~counter~0 5)} assume !(0 == ~cond); {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {10780#(<= ~counter~0 5)} assume true; {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,391 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10780#(<= ~counter~0 5)} {10780#(<= ~counter~0 5)} #63#return; {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,391 INFO L290 TraceCheckUtils]: 60: Hoare triple {10780#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,392 INFO L290 TraceCheckUtils]: 61: Hoare triple {10780#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10780#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:14,392 INFO L290 TraceCheckUtils]: 62: Hoare triple {10780#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {10808#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,393 INFO L272 TraceCheckUtils]: 64: Hoare triple {10808#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {10808#(<= ~counter~0 6)} ~cond := #in~cond; {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {10808#(<= ~counter~0 6)} assume !(0 == ~cond); {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {10808#(<= ~counter~0 6)} assume true; {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,394 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10808#(<= ~counter~0 6)} {10808#(<= ~counter~0 6)} #63#return; {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {10808#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {10808#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10808#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:14,395 INFO L290 TraceCheckUtils]: 71: Hoare triple {10808#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,396 INFO L290 TraceCheckUtils]: 72: Hoare triple {10836#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,397 INFO L272 TraceCheckUtils]: 73: Hoare triple {10836#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,397 INFO L290 TraceCheckUtils]: 74: Hoare triple {10836#(<= ~counter~0 7)} ~cond := #in~cond; {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,397 INFO L290 TraceCheckUtils]: 75: Hoare triple {10836#(<= ~counter~0 7)} assume !(0 == ~cond); {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {10836#(<= ~counter~0 7)} assume true; {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,398 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10836#(<= ~counter~0 7)} {10836#(<= ~counter~0 7)} #63#return; {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {10836#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,399 INFO L290 TraceCheckUtils]: 79: Hoare triple {10836#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10836#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:14,399 INFO L290 TraceCheckUtils]: 80: Hoare triple {10836#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {10864#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,400 INFO L272 TraceCheckUtils]: 82: Hoare triple {10864#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,400 INFO L290 TraceCheckUtils]: 83: Hoare triple {10864#(<= ~counter~0 8)} ~cond := #in~cond; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,400 INFO L290 TraceCheckUtils]: 84: Hoare triple {10864#(<= ~counter~0 8)} assume !(0 == ~cond); {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,401 INFO L290 TraceCheckUtils]: 85: Hoare triple {10864#(<= ~counter~0 8)} assume true; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,401 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10864#(<= ~counter~0 8)} {10864#(<= ~counter~0 8)} #63#return; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,401 INFO L290 TraceCheckUtils]: 87: Hoare triple {10864#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {10864#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:14,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {10864#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,402 INFO L290 TraceCheckUtils]: 90: Hoare triple {10892#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,403 INFO L272 TraceCheckUtils]: 91: Hoare triple {10892#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,403 INFO L290 TraceCheckUtils]: 92: Hoare triple {10892#(<= ~counter~0 9)} ~cond := #in~cond; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,403 INFO L290 TraceCheckUtils]: 93: Hoare triple {10892#(<= ~counter~0 9)} assume !(0 == ~cond); {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,404 INFO L290 TraceCheckUtils]: 94: Hoare triple {10892#(<= ~counter~0 9)} assume true; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,404 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10892#(<= ~counter~0 9)} {10892#(<= ~counter~0 9)} #63#return; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,404 INFO L290 TraceCheckUtils]: 96: Hoare triple {10892#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,405 INFO L290 TraceCheckUtils]: 97: Hoare triple {10892#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:14,405 INFO L290 TraceCheckUtils]: 98: Hoare triple {10892#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,405 INFO L290 TraceCheckUtils]: 99: Hoare triple {10920#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,406 INFO L272 TraceCheckUtils]: 100: Hoare triple {10920#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,406 INFO L290 TraceCheckUtils]: 101: Hoare triple {10920#(<= ~counter~0 10)} ~cond := #in~cond; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,406 INFO L290 TraceCheckUtils]: 102: Hoare triple {10920#(<= ~counter~0 10)} assume !(0 == ~cond); {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,407 INFO L290 TraceCheckUtils]: 103: Hoare triple {10920#(<= ~counter~0 10)} assume true; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,407 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10920#(<= ~counter~0 10)} {10920#(<= ~counter~0 10)} #63#return; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,407 INFO L290 TraceCheckUtils]: 105: Hoare triple {10920#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,408 INFO L290 TraceCheckUtils]: 106: Hoare triple {10920#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:14,408 INFO L290 TraceCheckUtils]: 107: Hoare triple {10920#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,408 INFO L290 TraceCheckUtils]: 108: Hoare triple {10948#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,409 INFO L272 TraceCheckUtils]: 109: Hoare triple {10948#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,409 INFO L290 TraceCheckUtils]: 110: Hoare triple {10948#(<= ~counter~0 11)} ~cond := #in~cond; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,410 INFO L290 TraceCheckUtils]: 111: Hoare triple {10948#(<= ~counter~0 11)} assume !(0 == ~cond); {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,410 INFO L290 TraceCheckUtils]: 112: Hoare triple {10948#(<= ~counter~0 11)} assume true; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,410 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {10948#(<= ~counter~0 11)} {10948#(<= ~counter~0 11)} #63#return; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,411 INFO L290 TraceCheckUtils]: 114: Hoare triple {10948#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,411 INFO L290 TraceCheckUtils]: 115: Hoare triple {10948#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:14,411 INFO L290 TraceCheckUtils]: 116: Hoare triple {10948#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10976#(<= |main_#t~post6| 11)} is VALID [2022-04-28 13:57:14,411 INFO L290 TraceCheckUtils]: 117: Hoare triple {10976#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {10612#false} is VALID [2022-04-28 13:57:14,412 INFO L272 TraceCheckUtils]: 118: Hoare triple {10612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {10612#false} is VALID [2022-04-28 13:57:14,412 INFO L290 TraceCheckUtils]: 119: Hoare triple {10612#false} ~cond := #in~cond; {10612#false} is VALID [2022-04-28 13:57:14,412 INFO L290 TraceCheckUtils]: 120: Hoare triple {10612#false} assume 0 == ~cond; {10612#false} is VALID [2022-04-28 13:57:14,412 INFO L290 TraceCheckUtils]: 121: Hoare triple {10612#false} assume !false; {10612#false} is VALID [2022-04-28 13:57:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 22 proven. 517 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:14,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:15,050 INFO L290 TraceCheckUtils]: 121: Hoare triple {10612#false} assume !false; {10612#false} is VALID [2022-04-28 13:57:15,050 INFO L290 TraceCheckUtils]: 120: Hoare triple {10612#false} assume 0 == ~cond; {10612#false} is VALID [2022-04-28 13:57:15,050 INFO L290 TraceCheckUtils]: 119: Hoare triple {10612#false} ~cond := #in~cond; {10612#false} is VALID [2022-04-28 13:57:15,050 INFO L272 TraceCheckUtils]: 118: Hoare triple {10612#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {10612#false} is VALID [2022-04-28 13:57:15,050 INFO L290 TraceCheckUtils]: 117: Hoare triple {11004#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {10612#false} is VALID [2022-04-28 13:57:15,051 INFO L290 TraceCheckUtils]: 116: Hoare triple {11008#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11004#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:15,051 INFO L290 TraceCheckUtils]: 115: Hoare triple {11008#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11008#(< ~counter~0 20)} is VALID [2022-04-28 13:57:15,051 INFO L290 TraceCheckUtils]: 114: Hoare triple {11008#(< ~counter~0 20)} assume !!(0 != ~y3~0); {11008#(< ~counter~0 20)} is VALID [2022-04-28 13:57:15,052 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {10611#true} {11008#(< ~counter~0 20)} #63#return; {11008#(< ~counter~0 20)} is VALID [2022-04-28 13:57:15,052 INFO L290 TraceCheckUtils]: 112: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,052 INFO L290 TraceCheckUtils]: 111: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,052 INFO L290 TraceCheckUtils]: 110: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,052 INFO L272 TraceCheckUtils]: 109: Hoare triple {11008#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,052 INFO L290 TraceCheckUtils]: 108: Hoare triple {11008#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {11008#(< ~counter~0 20)} is VALID [2022-04-28 13:57:15,053 INFO L290 TraceCheckUtils]: 107: Hoare triple {11036#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11008#(< ~counter~0 20)} is VALID [2022-04-28 13:57:15,053 INFO L290 TraceCheckUtils]: 106: Hoare triple {11036#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11036#(< ~counter~0 19)} is VALID [2022-04-28 13:57:15,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {11036#(< ~counter~0 19)} assume !!(0 != ~y3~0); {11036#(< ~counter~0 19)} is VALID [2022-04-28 13:57:15,054 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10611#true} {11036#(< ~counter~0 19)} #63#return; {11036#(< ~counter~0 19)} is VALID [2022-04-28 13:57:15,054 INFO L290 TraceCheckUtils]: 103: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,054 INFO L290 TraceCheckUtils]: 102: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,054 INFO L272 TraceCheckUtils]: 100: Hoare triple {11036#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {11036#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {11036#(< ~counter~0 19)} is VALID [2022-04-28 13:57:15,056 INFO L290 TraceCheckUtils]: 98: Hoare triple {11064#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11036#(< ~counter~0 19)} is VALID [2022-04-28 13:57:15,056 INFO L290 TraceCheckUtils]: 97: Hoare triple {11064#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11064#(< ~counter~0 18)} is VALID [2022-04-28 13:57:15,056 INFO L290 TraceCheckUtils]: 96: Hoare triple {11064#(< ~counter~0 18)} assume !!(0 != ~y3~0); {11064#(< ~counter~0 18)} is VALID [2022-04-28 13:57:15,057 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10611#true} {11064#(< ~counter~0 18)} #63#return; {11064#(< ~counter~0 18)} is VALID [2022-04-28 13:57:15,057 INFO L290 TraceCheckUtils]: 94: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,057 INFO L272 TraceCheckUtils]: 91: Hoare triple {11064#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {11064#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {11064#(< ~counter~0 18)} is VALID [2022-04-28 13:57:15,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {11092#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11064#(< ~counter~0 18)} is VALID [2022-04-28 13:57:15,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {11092#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11092#(< ~counter~0 17)} is VALID [2022-04-28 13:57:15,058 INFO L290 TraceCheckUtils]: 87: Hoare triple {11092#(< ~counter~0 17)} assume !!(0 != ~y3~0); {11092#(< ~counter~0 17)} is VALID [2022-04-28 13:57:15,059 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10611#true} {11092#(< ~counter~0 17)} #63#return; {11092#(< ~counter~0 17)} is VALID [2022-04-28 13:57:15,059 INFO L290 TraceCheckUtils]: 85: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,059 INFO L290 TraceCheckUtils]: 84: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,059 INFO L290 TraceCheckUtils]: 83: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,059 INFO L272 TraceCheckUtils]: 82: Hoare triple {11092#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,064 INFO L290 TraceCheckUtils]: 81: Hoare triple {11092#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {11092#(< ~counter~0 17)} is VALID [2022-04-28 13:57:15,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {11120#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11092#(< ~counter~0 17)} is VALID [2022-04-28 13:57:15,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {11120#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11120#(< ~counter~0 16)} is VALID [2022-04-28 13:57:15,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {11120#(< ~counter~0 16)} assume !!(0 != ~y3~0); {11120#(< ~counter~0 16)} is VALID [2022-04-28 13:57:15,066 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10611#true} {11120#(< ~counter~0 16)} #63#return; {11120#(< ~counter~0 16)} is VALID [2022-04-28 13:57:15,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,067 INFO L272 TraceCheckUtils]: 73: Hoare triple {11120#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {11120#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {11120#(< ~counter~0 16)} is VALID [2022-04-28 13:57:15,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {11148#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11120#(< ~counter~0 16)} is VALID [2022-04-28 13:57:15,067 INFO L290 TraceCheckUtils]: 70: Hoare triple {11148#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11148#(< ~counter~0 15)} is VALID [2022-04-28 13:57:15,068 INFO L290 TraceCheckUtils]: 69: Hoare triple {11148#(< ~counter~0 15)} assume !!(0 != ~y3~0); {11148#(< ~counter~0 15)} is VALID [2022-04-28 13:57:15,068 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10611#true} {11148#(< ~counter~0 15)} #63#return; {11148#(< ~counter~0 15)} is VALID [2022-04-28 13:57:15,068 INFO L290 TraceCheckUtils]: 67: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,068 INFO L290 TraceCheckUtils]: 66: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,068 INFO L272 TraceCheckUtils]: 64: Hoare triple {11148#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {11148#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {11148#(< ~counter~0 15)} is VALID [2022-04-28 13:57:15,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {11176#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11148#(< ~counter~0 15)} is VALID [2022-04-28 13:57:15,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {11176#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11176#(< ~counter~0 14)} is VALID [2022-04-28 13:57:15,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {11176#(< ~counter~0 14)} assume !!(0 != ~y3~0); {11176#(< ~counter~0 14)} is VALID [2022-04-28 13:57:15,072 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10611#true} {11176#(< ~counter~0 14)} #63#return; {11176#(< ~counter~0 14)} is VALID [2022-04-28 13:57:15,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,072 INFO L272 TraceCheckUtils]: 55: Hoare triple {11176#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {11176#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {11176#(< ~counter~0 14)} is VALID [2022-04-28 13:57:15,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {11204#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11176#(< ~counter~0 14)} is VALID [2022-04-28 13:57:15,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {11204#(< ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {11204#(< ~counter~0 13)} is VALID [2022-04-28 13:57:15,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {11204#(< ~counter~0 13)} assume !!(0 != ~y3~0); {11204#(< ~counter~0 13)} is VALID [2022-04-28 13:57:15,074 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10611#true} {11204#(< ~counter~0 13)} #63#return; {11204#(< ~counter~0 13)} is VALID [2022-04-28 13:57:15,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,074 INFO L272 TraceCheckUtils]: 46: Hoare triple {11204#(< ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {11204#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {11204#(< ~counter~0 13)} is VALID [2022-04-28 13:57:15,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {10948#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11204#(< ~counter~0 13)} is VALID [2022-04-28 13:57:15,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {10948#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:15,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {10948#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:15,079 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10611#true} {10948#(<= ~counter~0 11)} #63#return; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:15,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,080 INFO L272 TraceCheckUtils]: 37: Hoare triple {10948#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {10948#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:15,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {10920#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10948#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:15,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {10920#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:15,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {10920#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:15,096 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10611#true} {10920#(<= ~counter~0 10)} #63#return; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:15,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,096 INFO L272 TraceCheckUtils]: 28: Hoare triple {10920#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {10920#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:15,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {10892#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10920#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:15,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {10892#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:15,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {10892#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:15,099 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10611#true} {10892#(<= ~counter~0 9)} #63#return; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:15,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,099 INFO L272 TraceCheckUtils]: 19: Hoare triple {10892#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {10892#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:15,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {10864#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10892#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:15,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {10864#(<= ~counter~0 8)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10611#true} {10864#(<= ~counter~0 8)} #61#return; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {10864#(<= ~counter~0 8)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10611#true} {10864#(<= ~counter~0 8)} #59#return; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {10611#true} assume true; {10611#true} is VALID [2022-04-28 13:57:15,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {10611#true} assume !(0 == ~cond); {10611#true} is VALID [2022-04-28 13:57:15,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {10611#true} ~cond := #in~cond; {10611#true} is VALID [2022-04-28 13:57:15,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {10864#(<= ~counter~0 8)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {10611#true} is VALID [2022-04-28 13:57:15,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {10864#(<= ~counter~0 8)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {10864#(<= ~counter~0 8)} call #t~ret7 := main(); {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10864#(<= ~counter~0 8)} {10611#true} #67#return; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {10864#(<= ~counter~0 8)} assume true; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {10611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10864#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:15,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {10611#true} call ULTIMATE.init(); {10611#true} is VALID [2022-04-28 13:57:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 22 proven. 297 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 13:57:15,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38737656] [2022-04-28 13:57:15,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533518687] [2022-04-28 13:57:15,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533518687] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:15,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:15,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 13:57:15,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:15,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811220522] [2022-04-28 13:57:15,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811220522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:15,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:15,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 13:57:15,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275216911] [2022-04-28 13:57:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:15,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 122 [2022-04-28 13:57:15,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:15,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 13:57:15,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:15,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 13:57:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:15,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 13:57:15,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:15,197 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 13:57:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:15,684 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2022-04-28 13:57:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 13:57:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 122 [2022-04-28 13:57:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 13:57:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2022-04-28 13:57:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 13:57:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2022-04-28 13:57:15,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 145 transitions. [2022-04-28 13:57:15,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:15,815 INFO L225 Difference]: With dead ends: 133 [2022-04-28 13:57:15,815 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 13:57:15,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 13:57:15,816 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:15,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 164 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 13:57:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-04-28 13:57:15,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:15,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:57:15,952 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:57:15,952 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:57:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:15,955 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-04-28 13:57:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-28 13:57:15,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:15,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:15,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 128 states. [2022-04-28 13:57:15,956 INFO L87 Difference]: Start difference. First operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 128 states. [2022-04-28 13:57:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:15,959 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-04-28 13:57:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-28 13:57:15,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:15,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:15,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:15,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 13:57:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-04-28 13:57:15,962 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 122 [2022-04-28 13:57:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:15,962 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-04-28 13:57:15,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 13:57:15,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 141 transitions. [2022-04-28 13:57:16,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-28 13:57:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 13:57:16,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:16,136 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:16,160 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 13:57:16,337 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 13:57:16,337 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash 881443734, now seen corresponding path program 23 times [2022-04-28 13:57:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1470473431] [2022-04-28 13:57:16,338 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 881443734, now seen corresponding path program 24 times [2022-04-28 13:57:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252242837] [2022-04-28 13:57:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:16,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860854624] [2022-04-28 13:57:16,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:57:16,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:16,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:16,364 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 13:57:16,365 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 13:57:16,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 13:57:16,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:16,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 13:57:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:16,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:17,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {12166#true} call ULTIMATE.init(); {12166#true} is VALID [2022-04-28 13:57:17,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {12166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {12174#(<= ~counter~0 0)} assume true; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12174#(<= ~counter~0 0)} {12166#true} #67#return; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {12174#(<= ~counter~0 0)} call #t~ret7 := main(); {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {12174#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {12174#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {12174#(<= ~counter~0 0)} ~cond := #in~cond; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {12174#(<= ~counter~0 0)} assume !(0 == ~cond); {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {12174#(<= ~counter~0 0)} assume true; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,112 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12174#(<= ~counter~0 0)} {12174#(<= ~counter~0 0)} #59#return; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,113 INFO L272 TraceCheckUtils]: 11: Hoare triple {12174#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {12174#(<= ~counter~0 0)} ~cond := #in~cond; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {12174#(<= ~counter~0 0)} assume !(0 == ~cond); {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {12174#(<= ~counter~0 0)} assume true; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,114 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12174#(<= ~counter~0 0)} {12174#(<= ~counter~0 0)} #61#return; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {12174#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {12174#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:17,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {12174#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {12223#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,115 INFO L272 TraceCheckUtils]: 19: Hoare triple {12223#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {12223#(<= ~counter~0 1)} ~cond := #in~cond; {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {12223#(<= ~counter~0 1)} assume !(0 == ~cond); {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {12223#(<= ~counter~0 1)} assume true; {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,117 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12223#(<= ~counter~0 1)} {12223#(<= ~counter~0 1)} #63#return; {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {12223#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {12223#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12223#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:17,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {12223#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {12251#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,118 INFO L272 TraceCheckUtils]: 28: Hoare triple {12251#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {12251#(<= ~counter~0 2)} ~cond := #in~cond; {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {12251#(<= ~counter~0 2)} assume !(0 == ~cond); {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {12251#(<= ~counter~0 2)} assume true; {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,120 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12251#(<= ~counter~0 2)} {12251#(<= ~counter~0 2)} #63#return; {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {12251#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {12251#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12251#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:17,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {12251#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {12279#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,122 INFO L272 TraceCheckUtils]: 37: Hoare triple {12279#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {12279#(<= ~counter~0 3)} ~cond := #in~cond; {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {12279#(<= ~counter~0 3)} assume !(0 == ~cond); {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {12279#(<= ~counter~0 3)} assume true; {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,123 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12279#(<= ~counter~0 3)} {12279#(<= ~counter~0 3)} #63#return; {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {12279#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,123 INFO L290 TraceCheckUtils]: 43: Hoare triple {12279#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12279#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:17,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {12279#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {12307#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,125 INFO L272 TraceCheckUtils]: 46: Hoare triple {12307#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {12307#(<= ~counter~0 4)} ~cond := #in~cond; {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {12307#(<= ~counter~0 4)} assume !(0 == ~cond); {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {12307#(<= ~counter~0 4)} assume true; {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,126 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12307#(<= ~counter~0 4)} {12307#(<= ~counter~0 4)} #63#return; {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {12307#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {12307#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12307#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:17,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {12307#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {12335#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,128 INFO L272 TraceCheckUtils]: 55: Hoare triple {12335#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {12335#(<= ~counter~0 5)} ~cond := #in~cond; {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {12335#(<= ~counter~0 5)} assume !(0 == ~cond); {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {12335#(<= ~counter~0 5)} assume true; {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,129 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12335#(<= ~counter~0 5)} {12335#(<= ~counter~0 5)} #63#return; {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {12335#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {12335#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12335#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:17,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {12335#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {12363#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,131 INFO L272 TraceCheckUtils]: 64: Hoare triple {12363#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {12363#(<= ~counter~0 6)} ~cond := #in~cond; {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {12363#(<= ~counter~0 6)} assume !(0 == ~cond); {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,132 INFO L290 TraceCheckUtils]: 67: Hoare triple {12363#(<= ~counter~0 6)} assume true; {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,132 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12363#(<= ~counter~0 6)} {12363#(<= ~counter~0 6)} #63#return; {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,132 INFO L290 TraceCheckUtils]: 69: Hoare triple {12363#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,133 INFO L290 TraceCheckUtils]: 70: Hoare triple {12363#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12363#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:17,133 INFO L290 TraceCheckUtils]: 71: Hoare triple {12363#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,133 INFO L290 TraceCheckUtils]: 72: Hoare triple {12391#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,134 INFO L272 TraceCheckUtils]: 73: Hoare triple {12391#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,134 INFO L290 TraceCheckUtils]: 74: Hoare triple {12391#(<= ~counter~0 7)} ~cond := #in~cond; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,134 INFO L290 TraceCheckUtils]: 75: Hoare triple {12391#(<= ~counter~0 7)} assume !(0 == ~cond); {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,135 INFO L290 TraceCheckUtils]: 76: Hoare triple {12391#(<= ~counter~0 7)} assume true; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,135 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12391#(<= ~counter~0 7)} {12391#(<= ~counter~0 7)} #63#return; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,135 INFO L290 TraceCheckUtils]: 78: Hoare triple {12391#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,136 INFO L290 TraceCheckUtils]: 79: Hoare triple {12391#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,136 INFO L290 TraceCheckUtils]: 80: Hoare triple {12391#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,136 INFO L290 TraceCheckUtils]: 81: Hoare triple {12419#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,137 INFO L272 TraceCheckUtils]: 82: Hoare triple {12419#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,137 INFO L290 TraceCheckUtils]: 83: Hoare triple {12419#(<= ~counter~0 8)} ~cond := #in~cond; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {12419#(<= ~counter~0 8)} assume !(0 == ~cond); {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,138 INFO L290 TraceCheckUtils]: 85: Hoare triple {12419#(<= ~counter~0 8)} assume true; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,138 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12419#(<= ~counter~0 8)} {12419#(<= ~counter~0 8)} #63#return; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,139 INFO L290 TraceCheckUtils]: 87: Hoare triple {12419#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,139 INFO L290 TraceCheckUtils]: 88: Hoare triple {12419#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,139 INFO L290 TraceCheckUtils]: 89: Hoare triple {12419#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,139 INFO L290 TraceCheckUtils]: 90: Hoare triple {12447#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,140 INFO L272 TraceCheckUtils]: 91: Hoare triple {12447#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,140 INFO L290 TraceCheckUtils]: 92: Hoare triple {12447#(<= ~counter~0 9)} ~cond := #in~cond; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {12447#(<= ~counter~0 9)} assume !(0 == ~cond); {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,141 INFO L290 TraceCheckUtils]: 94: Hoare triple {12447#(<= ~counter~0 9)} assume true; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,141 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12447#(<= ~counter~0 9)} {12447#(<= ~counter~0 9)} #63#return; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {12447#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {12447#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {12447#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,143 INFO L290 TraceCheckUtils]: 99: Hoare triple {12475#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,143 INFO L272 TraceCheckUtils]: 100: Hoare triple {12475#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,143 INFO L290 TraceCheckUtils]: 101: Hoare triple {12475#(<= ~counter~0 10)} ~cond := #in~cond; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,144 INFO L290 TraceCheckUtils]: 102: Hoare triple {12475#(<= ~counter~0 10)} assume !(0 == ~cond); {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,144 INFO L290 TraceCheckUtils]: 103: Hoare triple {12475#(<= ~counter~0 10)} assume true; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,144 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12475#(<= ~counter~0 10)} {12475#(<= ~counter~0 10)} #63#return; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,145 INFO L290 TraceCheckUtils]: 105: Hoare triple {12475#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,145 INFO L290 TraceCheckUtils]: 106: Hoare triple {12475#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,145 INFO L290 TraceCheckUtils]: 107: Hoare triple {12475#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,146 INFO L290 TraceCheckUtils]: 108: Hoare triple {12503#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,146 INFO L272 TraceCheckUtils]: 109: Hoare triple {12503#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,146 INFO L290 TraceCheckUtils]: 110: Hoare triple {12503#(<= ~counter~0 11)} ~cond := #in~cond; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,147 INFO L290 TraceCheckUtils]: 111: Hoare triple {12503#(<= ~counter~0 11)} assume !(0 == ~cond); {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,147 INFO L290 TraceCheckUtils]: 112: Hoare triple {12503#(<= ~counter~0 11)} assume true; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,147 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {12503#(<= ~counter~0 11)} {12503#(<= ~counter~0 11)} #63#return; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,148 INFO L290 TraceCheckUtils]: 114: Hoare triple {12503#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,148 INFO L290 TraceCheckUtils]: 115: Hoare triple {12503#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,148 INFO L290 TraceCheckUtils]: 116: Hoare triple {12503#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {12531#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,149 INFO L272 TraceCheckUtils]: 118: Hoare triple {12531#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,149 INFO L290 TraceCheckUtils]: 119: Hoare triple {12531#(<= ~counter~0 12)} ~cond := #in~cond; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,150 INFO L290 TraceCheckUtils]: 120: Hoare triple {12531#(<= ~counter~0 12)} assume !(0 == ~cond); {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,150 INFO L290 TraceCheckUtils]: 121: Hoare triple {12531#(<= ~counter~0 12)} assume true; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,150 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12531#(<= ~counter~0 12)} {12531#(<= ~counter~0 12)} #63#return; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,151 INFO L290 TraceCheckUtils]: 123: Hoare triple {12531#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,151 INFO L290 TraceCheckUtils]: 124: Hoare triple {12531#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,151 INFO L290 TraceCheckUtils]: 125: Hoare triple {12531#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12559#(<= |main_#t~post6| 12)} is VALID [2022-04-28 13:57:17,152 INFO L290 TraceCheckUtils]: 126: Hoare triple {12559#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {12167#false} is VALID [2022-04-28 13:57:17,152 INFO L272 TraceCheckUtils]: 127: Hoare triple {12167#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {12167#false} is VALID [2022-04-28 13:57:17,152 INFO L290 TraceCheckUtils]: 128: Hoare triple {12167#false} ~cond := #in~cond; {12167#false} is VALID [2022-04-28 13:57:17,152 INFO L290 TraceCheckUtils]: 129: Hoare triple {12167#false} assume 0 == ~cond; {12167#false} is VALID [2022-04-28 13:57:17,152 INFO L290 TraceCheckUtils]: 130: Hoare triple {12167#false} assume !false; {12167#false} is VALID [2022-04-28 13:57:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 24 proven. 618 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:17,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:17,805 INFO L290 TraceCheckUtils]: 130: Hoare triple {12167#false} assume !false; {12167#false} is VALID [2022-04-28 13:57:17,805 INFO L290 TraceCheckUtils]: 129: Hoare triple {12167#false} assume 0 == ~cond; {12167#false} is VALID [2022-04-28 13:57:17,805 INFO L290 TraceCheckUtils]: 128: Hoare triple {12167#false} ~cond := #in~cond; {12167#false} is VALID [2022-04-28 13:57:17,805 INFO L272 TraceCheckUtils]: 127: Hoare triple {12167#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {12167#false} is VALID [2022-04-28 13:57:17,805 INFO L290 TraceCheckUtils]: 126: Hoare triple {12587#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {12167#false} is VALID [2022-04-28 13:57:17,806 INFO L290 TraceCheckUtils]: 125: Hoare triple {12591#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12587#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:17,806 INFO L290 TraceCheckUtils]: 124: Hoare triple {12591#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12591#(< ~counter~0 20)} is VALID [2022-04-28 13:57:17,806 INFO L290 TraceCheckUtils]: 123: Hoare triple {12591#(< ~counter~0 20)} assume !!(0 != ~y3~0); {12591#(< ~counter~0 20)} is VALID [2022-04-28 13:57:17,807 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12166#true} {12591#(< ~counter~0 20)} #63#return; {12591#(< ~counter~0 20)} is VALID [2022-04-28 13:57:17,807 INFO L290 TraceCheckUtils]: 121: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,807 INFO L290 TraceCheckUtils]: 120: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,807 INFO L272 TraceCheckUtils]: 118: Hoare triple {12591#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,807 INFO L290 TraceCheckUtils]: 117: Hoare triple {12591#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {12591#(< ~counter~0 20)} is VALID [2022-04-28 13:57:17,808 INFO L290 TraceCheckUtils]: 116: Hoare triple {12619#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12591#(< ~counter~0 20)} is VALID [2022-04-28 13:57:17,808 INFO L290 TraceCheckUtils]: 115: Hoare triple {12619#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12619#(< ~counter~0 19)} is VALID [2022-04-28 13:57:17,808 INFO L290 TraceCheckUtils]: 114: Hoare triple {12619#(< ~counter~0 19)} assume !!(0 != ~y3~0); {12619#(< ~counter~0 19)} is VALID [2022-04-28 13:57:17,809 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {12166#true} {12619#(< ~counter~0 19)} #63#return; {12619#(< ~counter~0 19)} is VALID [2022-04-28 13:57:17,809 INFO L290 TraceCheckUtils]: 112: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,809 INFO L290 TraceCheckUtils]: 111: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,809 INFO L290 TraceCheckUtils]: 110: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,809 INFO L272 TraceCheckUtils]: 109: Hoare triple {12619#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,809 INFO L290 TraceCheckUtils]: 108: Hoare triple {12619#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {12619#(< ~counter~0 19)} is VALID [2022-04-28 13:57:17,810 INFO L290 TraceCheckUtils]: 107: Hoare triple {12647#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12619#(< ~counter~0 19)} is VALID [2022-04-28 13:57:17,810 INFO L290 TraceCheckUtils]: 106: Hoare triple {12647#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12647#(< ~counter~0 18)} is VALID [2022-04-28 13:57:17,810 INFO L290 TraceCheckUtils]: 105: Hoare triple {12647#(< ~counter~0 18)} assume !!(0 != ~y3~0); {12647#(< ~counter~0 18)} is VALID [2022-04-28 13:57:17,811 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12166#true} {12647#(< ~counter~0 18)} #63#return; {12647#(< ~counter~0 18)} is VALID [2022-04-28 13:57:17,811 INFO L290 TraceCheckUtils]: 103: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,811 INFO L290 TraceCheckUtils]: 102: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,811 INFO L290 TraceCheckUtils]: 101: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,811 INFO L272 TraceCheckUtils]: 100: Hoare triple {12647#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,811 INFO L290 TraceCheckUtils]: 99: Hoare triple {12647#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {12647#(< ~counter~0 18)} is VALID [2022-04-28 13:57:17,812 INFO L290 TraceCheckUtils]: 98: Hoare triple {12675#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12647#(< ~counter~0 18)} is VALID [2022-04-28 13:57:17,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {12675#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12675#(< ~counter~0 17)} is VALID [2022-04-28 13:57:17,812 INFO L290 TraceCheckUtils]: 96: Hoare triple {12675#(< ~counter~0 17)} assume !!(0 != ~y3~0); {12675#(< ~counter~0 17)} is VALID [2022-04-28 13:57:17,813 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12166#true} {12675#(< ~counter~0 17)} #63#return; {12675#(< ~counter~0 17)} is VALID [2022-04-28 13:57:17,813 INFO L290 TraceCheckUtils]: 94: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,813 INFO L272 TraceCheckUtils]: 91: Hoare triple {12675#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,813 INFO L290 TraceCheckUtils]: 90: Hoare triple {12675#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {12675#(< ~counter~0 17)} is VALID [2022-04-28 13:57:17,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {12703#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12675#(< ~counter~0 17)} is VALID [2022-04-28 13:57:17,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {12703#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12703#(< ~counter~0 16)} is VALID [2022-04-28 13:57:17,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {12703#(< ~counter~0 16)} assume !!(0 != ~y3~0); {12703#(< ~counter~0 16)} is VALID [2022-04-28 13:57:17,815 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12166#true} {12703#(< ~counter~0 16)} #63#return; {12703#(< ~counter~0 16)} is VALID [2022-04-28 13:57:17,815 INFO L290 TraceCheckUtils]: 85: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,815 INFO L290 TraceCheckUtils]: 84: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,815 INFO L272 TraceCheckUtils]: 82: Hoare triple {12703#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,815 INFO L290 TraceCheckUtils]: 81: Hoare triple {12703#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {12703#(< ~counter~0 16)} is VALID [2022-04-28 13:57:17,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {12731#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12703#(< ~counter~0 16)} is VALID [2022-04-28 13:57:17,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {12731#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12731#(< ~counter~0 15)} is VALID [2022-04-28 13:57:17,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {12731#(< ~counter~0 15)} assume !!(0 != ~y3~0); {12731#(< ~counter~0 15)} is VALID [2022-04-28 13:57:17,817 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12166#true} {12731#(< ~counter~0 15)} #63#return; {12731#(< ~counter~0 15)} is VALID [2022-04-28 13:57:17,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,817 INFO L272 TraceCheckUtils]: 73: Hoare triple {12731#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {12731#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {12731#(< ~counter~0 15)} is VALID [2022-04-28 13:57:17,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {12759#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12731#(< ~counter~0 15)} is VALID [2022-04-28 13:57:17,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {12759#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12759#(< ~counter~0 14)} is VALID [2022-04-28 13:57:17,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {12759#(< ~counter~0 14)} assume !!(0 != ~y3~0); {12759#(< ~counter~0 14)} is VALID [2022-04-28 13:57:17,819 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12166#true} {12759#(< ~counter~0 14)} #63#return; {12759#(< ~counter~0 14)} is VALID [2022-04-28 13:57:17,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,819 INFO L272 TraceCheckUtils]: 64: Hoare triple {12759#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {12759#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {12759#(< ~counter~0 14)} is VALID [2022-04-28 13:57:17,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {12531#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12759#(< ~counter~0 14)} is VALID [2022-04-28 13:57:17,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {12531#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {12531#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,821 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12166#true} {12531#(<= ~counter~0 12)} #63#return; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,821 INFO L272 TraceCheckUtils]: 55: Hoare triple {12531#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {12531#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {12503#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12531#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:17,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {12503#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {12503#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,823 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12166#true} {12503#(<= ~counter~0 11)} #63#return; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,823 INFO L272 TraceCheckUtils]: 46: Hoare triple {12503#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {12503#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {12475#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12503#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:17,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {12475#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,824 INFO L290 TraceCheckUtils]: 42: Hoare triple {12475#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,825 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12166#true} {12475#(<= ~counter~0 10)} #63#return; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,825 INFO L272 TraceCheckUtils]: 37: Hoare triple {12475#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {12475#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {12447#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12475#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:17,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {12447#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {12447#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,827 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12166#true} {12447#(<= ~counter~0 9)} #63#return; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,827 INFO L272 TraceCheckUtils]: 28: Hoare triple {12447#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {12447#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {12419#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12447#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:17,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {12419#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {12419#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,829 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12166#true} {12419#(<= ~counter~0 8)} #63#return; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,829 INFO L272 TraceCheckUtils]: 19: Hoare triple {12419#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {12419#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12419#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:17,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {12391#(<= ~counter~0 7)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,830 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12166#true} {12391#(<= ~counter~0 7)} #61#return; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {12391#(<= ~counter~0 7)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12166#true} {12391#(<= ~counter~0 7)} #59#return; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {12166#true} assume true; {12166#true} is VALID [2022-04-28 13:57:17,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {12166#true} assume !(0 == ~cond); {12166#true} is VALID [2022-04-28 13:57:17,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {12166#true} ~cond := #in~cond; {12166#true} is VALID [2022-04-28 13:57:17,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#(<= ~counter~0 7)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {12166#true} is VALID [2022-04-28 13:57:17,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#(<= ~counter~0 7)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#(<= ~counter~0 7)} call #t~ret7 := main(); {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#(<= ~counter~0 7)} {12166#true} #67#return; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#(<= ~counter~0 7)} assume true; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {12166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12391#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:17,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {12166#true} call ULTIMATE.init(); {12166#true} is VALID [2022-04-28 13:57:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 24 proven. 354 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 13:57:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252242837] [2022-04-28 13:57:17,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860854624] [2022-04-28 13:57:17,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860854624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:17,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:17,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 13:57:17,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1470473431] [2022-04-28 13:57:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1470473431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:17,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:17,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 13:57:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182025241] [2022-04-28 13:57:17,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 131 [2022-04-28 13:57:17,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:17,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 13:57:17,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:17,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 13:57:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:17,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 13:57:17,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:17,919 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 13:57:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:18,375 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2022-04-28 13:57:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 13:57:18,376 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 131 [2022-04-28 13:57:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 13:57:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 155 transitions. [2022-04-28 13:57:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 13:57:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 155 transitions. [2022-04-28 13:57:18,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 155 transitions. [2022-04-28 13:57:18,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:18,506 INFO L225 Difference]: With dead ends: 142 [2022-04-28 13:57:18,506 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 13:57:18,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 13:57:18,507 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 51 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:18,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 166 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 13:57:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-28 13:57:18,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:18,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 13:57:18,664 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 13:57:18,664 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 13:57:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:18,667 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-04-28 13:57:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-28 13:57:18,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:18,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:18,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 137 states. [2022-04-28 13:57:18,668 INFO L87 Difference]: Start difference. First operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 137 states. [2022-04-28 13:57:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:18,670 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-04-28 13:57:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-28 13:57:18,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:18,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:18,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:18,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 13:57:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2022-04-28 13:57:18,674 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 131 [2022-04-28 13:57:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:18,674 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2022-04-28 13:57:18,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 13:57:18,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 151 transitions. [2022-04-28 13:57:18,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-28 13:57:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-28 13:57:18,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:18,842 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:18,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 13:57:19,043 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 13:57:19,043 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2089018524, now seen corresponding path program 25 times [2022-04-28 13:57:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559576602] [2022-04-28 13:57:19,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2089018524, now seen corresponding path program 26 times [2022-04-28 13:57:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190524124] [2022-04-28 13:57:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:19,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534129058] [2022-04-28 13:57:19,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:19,060 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 13:57:19,061 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 13:57:19,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:19,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:19,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 13:57:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:19,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:19,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {13831#true} call ULTIMATE.init(); {13831#true} is VALID [2022-04-28 13:57:19,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {13839#(<= ~counter~0 0)} assume true; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13839#(<= ~counter~0 0)} {13831#true} #67#return; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {13839#(<= ~counter~0 0)} call #t~ret7 := main(); {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {13839#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {13839#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {13839#(<= ~counter~0 0)} ~cond := #in~cond; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {13839#(<= ~counter~0 0)} assume !(0 == ~cond); {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {13839#(<= ~counter~0 0)} assume true; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13839#(<= ~counter~0 0)} {13839#(<= ~counter~0 0)} #59#return; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {13839#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {13839#(<= ~counter~0 0)} ~cond := #in~cond; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {13839#(<= ~counter~0 0)} assume !(0 == ~cond); {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {13839#(<= ~counter~0 0)} assume true; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13839#(<= ~counter~0 0)} {13839#(<= ~counter~0 0)} #61#return; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {13839#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {13839#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:19,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {13839#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {13888#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {13888#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {13888#(<= ~counter~0 1)} ~cond := #in~cond; {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {13888#(<= ~counter~0 1)} assume !(0 == ~cond); {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {13888#(<= ~counter~0 1)} assume true; {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13888#(<= ~counter~0 1)} {13888#(<= ~counter~0 1)} #63#return; {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {13888#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {13888#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {13888#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:19,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {13888#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {13916#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,856 INFO L272 TraceCheckUtils]: 28: Hoare triple {13916#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {13916#(<= ~counter~0 2)} ~cond := #in~cond; {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {13916#(<= ~counter~0 2)} assume !(0 == ~cond); {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {13916#(<= ~counter~0 2)} assume true; {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,858 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13916#(<= ~counter~0 2)} {13916#(<= ~counter~0 2)} #63#return; {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {13916#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {13916#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {13916#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:19,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {13916#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {13944#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,860 INFO L272 TraceCheckUtils]: 37: Hoare triple {13944#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {13944#(<= ~counter~0 3)} ~cond := #in~cond; {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {13944#(<= ~counter~0 3)} assume !(0 == ~cond); {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {13944#(<= ~counter~0 3)} assume true; {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,861 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13944#(<= ~counter~0 3)} {13944#(<= ~counter~0 3)} #63#return; {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {13944#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {13944#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {13944#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:19,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {13944#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {13972#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,863 INFO L272 TraceCheckUtils]: 46: Hoare triple {13972#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {13972#(<= ~counter~0 4)} ~cond := #in~cond; {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {13972#(<= ~counter~0 4)} assume !(0 == ~cond); {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {13972#(<= ~counter~0 4)} assume true; {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,864 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13972#(<= ~counter~0 4)} {13972#(<= ~counter~0 4)} #63#return; {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {13972#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {13972#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {13972#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:19,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {13972#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {14000#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,866 INFO L272 TraceCheckUtils]: 55: Hoare triple {14000#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {14000#(<= ~counter~0 5)} ~cond := #in~cond; {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {14000#(<= ~counter~0 5)} assume !(0 == ~cond); {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {14000#(<= ~counter~0 5)} assume true; {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,867 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14000#(<= ~counter~0 5)} {14000#(<= ~counter~0 5)} #63#return; {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,868 INFO L290 TraceCheckUtils]: 60: Hoare triple {14000#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,868 INFO L290 TraceCheckUtils]: 61: Hoare triple {14000#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14000#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:19,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {14000#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,869 INFO L290 TraceCheckUtils]: 63: Hoare triple {14028#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,869 INFO L272 TraceCheckUtils]: 64: Hoare triple {14028#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {14028#(<= ~counter~0 6)} ~cond := #in~cond; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {14028#(<= ~counter~0 6)} assume !(0 == ~cond); {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {14028#(<= ~counter~0 6)} assume true; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,871 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14028#(<= ~counter~0 6)} {14028#(<= ~counter~0 6)} #63#return; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {14028#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {14028#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:19,872 INFO L290 TraceCheckUtils]: 71: Hoare triple {14028#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {14056#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,872 INFO L272 TraceCheckUtils]: 73: Hoare triple {14056#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,873 INFO L290 TraceCheckUtils]: 74: Hoare triple {14056#(<= ~counter~0 7)} ~cond := #in~cond; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,873 INFO L290 TraceCheckUtils]: 75: Hoare triple {14056#(<= ~counter~0 7)} assume !(0 == ~cond); {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {14056#(<= ~counter~0 7)} assume true; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,874 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {14056#(<= ~counter~0 7)} {14056#(<= ~counter~0 7)} #63#return; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {14056#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {14056#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:19,875 INFO L290 TraceCheckUtils]: 80: Hoare triple {14056#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,875 INFO L290 TraceCheckUtils]: 81: Hoare triple {14084#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,875 INFO L272 TraceCheckUtils]: 82: Hoare triple {14084#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,876 INFO L290 TraceCheckUtils]: 83: Hoare triple {14084#(<= ~counter~0 8)} ~cond := #in~cond; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,876 INFO L290 TraceCheckUtils]: 84: Hoare triple {14084#(<= ~counter~0 8)} assume !(0 == ~cond); {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,876 INFO L290 TraceCheckUtils]: 85: Hoare triple {14084#(<= ~counter~0 8)} assume true; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,877 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14084#(<= ~counter~0 8)} {14084#(<= ~counter~0 8)} #63#return; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,877 INFO L290 TraceCheckUtils]: 87: Hoare triple {14084#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,877 INFO L290 TraceCheckUtils]: 88: Hoare triple {14084#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:19,878 INFO L290 TraceCheckUtils]: 89: Hoare triple {14084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,878 INFO L290 TraceCheckUtils]: 90: Hoare triple {14112#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,879 INFO L272 TraceCheckUtils]: 91: Hoare triple {14112#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,879 INFO L290 TraceCheckUtils]: 92: Hoare triple {14112#(<= ~counter~0 9)} ~cond := #in~cond; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,879 INFO L290 TraceCheckUtils]: 93: Hoare triple {14112#(<= ~counter~0 9)} assume !(0 == ~cond); {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,879 INFO L290 TraceCheckUtils]: 94: Hoare triple {14112#(<= ~counter~0 9)} assume true; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,880 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {14112#(<= ~counter~0 9)} {14112#(<= ~counter~0 9)} #63#return; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,880 INFO L290 TraceCheckUtils]: 96: Hoare triple {14112#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,880 INFO L290 TraceCheckUtils]: 97: Hoare triple {14112#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:19,881 INFO L290 TraceCheckUtils]: 98: Hoare triple {14112#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,881 INFO L290 TraceCheckUtils]: 99: Hoare triple {14140#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,882 INFO L272 TraceCheckUtils]: 100: Hoare triple {14140#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {14140#(<= ~counter~0 10)} ~cond := #in~cond; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {14140#(<= ~counter~0 10)} assume !(0 == ~cond); {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,882 INFO L290 TraceCheckUtils]: 103: Hoare triple {14140#(<= ~counter~0 10)} assume true; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,883 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {14140#(<= ~counter~0 10)} {14140#(<= ~counter~0 10)} #63#return; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,883 INFO L290 TraceCheckUtils]: 105: Hoare triple {14140#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,883 INFO L290 TraceCheckUtils]: 106: Hoare triple {14140#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:19,884 INFO L290 TraceCheckUtils]: 107: Hoare triple {14140#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,884 INFO L290 TraceCheckUtils]: 108: Hoare triple {14168#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,885 INFO L272 TraceCheckUtils]: 109: Hoare triple {14168#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,885 INFO L290 TraceCheckUtils]: 110: Hoare triple {14168#(<= ~counter~0 11)} ~cond := #in~cond; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,885 INFO L290 TraceCheckUtils]: 111: Hoare triple {14168#(<= ~counter~0 11)} assume !(0 == ~cond); {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {14168#(<= ~counter~0 11)} assume true; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,886 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {14168#(<= ~counter~0 11)} {14168#(<= ~counter~0 11)} #63#return; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {14168#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {14168#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:19,887 INFO L290 TraceCheckUtils]: 116: Hoare triple {14168#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,887 INFO L290 TraceCheckUtils]: 117: Hoare triple {14196#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,888 INFO L272 TraceCheckUtils]: 118: Hoare triple {14196#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,888 INFO L290 TraceCheckUtils]: 119: Hoare triple {14196#(<= ~counter~0 12)} ~cond := #in~cond; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,888 INFO L290 TraceCheckUtils]: 120: Hoare triple {14196#(<= ~counter~0 12)} assume !(0 == ~cond); {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,888 INFO L290 TraceCheckUtils]: 121: Hoare triple {14196#(<= ~counter~0 12)} assume true; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,889 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14196#(<= ~counter~0 12)} {14196#(<= ~counter~0 12)} #63#return; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,889 INFO L290 TraceCheckUtils]: 123: Hoare triple {14196#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,889 INFO L290 TraceCheckUtils]: 124: Hoare triple {14196#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:19,890 INFO L290 TraceCheckUtils]: 125: Hoare triple {14196#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,890 INFO L290 TraceCheckUtils]: 126: Hoare triple {14224#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,891 INFO L272 TraceCheckUtils]: 127: Hoare triple {14224#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,891 INFO L290 TraceCheckUtils]: 128: Hoare triple {14224#(<= ~counter~0 13)} ~cond := #in~cond; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,891 INFO L290 TraceCheckUtils]: 129: Hoare triple {14224#(<= ~counter~0 13)} assume !(0 == ~cond); {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,891 INFO L290 TraceCheckUtils]: 130: Hoare triple {14224#(<= ~counter~0 13)} assume true; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,892 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {14224#(<= ~counter~0 13)} {14224#(<= ~counter~0 13)} #63#return; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,892 INFO L290 TraceCheckUtils]: 132: Hoare triple {14224#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,893 INFO L290 TraceCheckUtils]: 133: Hoare triple {14224#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:19,893 INFO L290 TraceCheckUtils]: 134: Hoare triple {14224#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14252#(<= |main_#t~post6| 13)} is VALID [2022-04-28 13:57:19,893 INFO L290 TraceCheckUtils]: 135: Hoare triple {14252#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {13832#false} is VALID [2022-04-28 13:57:19,893 INFO L272 TraceCheckUtils]: 136: Hoare triple {13832#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {13832#false} is VALID [2022-04-28 13:57:19,893 INFO L290 TraceCheckUtils]: 137: Hoare triple {13832#false} ~cond := #in~cond; {13832#false} is VALID [2022-04-28 13:57:19,893 INFO L290 TraceCheckUtils]: 138: Hoare triple {13832#false} assume 0 == ~cond; {13832#false} is VALID [2022-04-28 13:57:19,893 INFO L290 TraceCheckUtils]: 139: Hoare triple {13832#false} assume !false; {13832#false} is VALID [2022-04-28 13:57:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 26 proven. 728 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:19,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:20,569 INFO L290 TraceCheckUtils]: 139: Hoare triple {13832#false} assume !false; {13832#false} is VALID [2022-04-28 13:57:20,569 INFO L290 TraceCheckUtils]: 138: Hoare triple {13832#false} assume 0 == ~cond; {13832#false} is VALID [2022-04-28 13:57:20,569 INFO L290 TraceCheckUtils]: 137: Hoare triple {13832#false} ~cond := #in~cond; {13832#false} is VALID [2022-04-28 13:57:20,569 INFO L272 TraceCheckUtils]: 136: Hoare triple {13832#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {13832#false} is VALID [2022-04-28 13:57:20,569 INFO L290 TraceCheckUtils]: 135: Hoare triple {14280#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {13832#false} is VALID [2022-04-28 13:57:20,570 INFO L290 TraceCheckUtils]: 134: Hoare triple {14284#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14280#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:20,570 INFO L290 TraceCheckUtils]: 133: Hoare triple {14284#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14284#(< ~counter~0 20)} is VALID [2022-04-28 13:57:20,570 INFO L290 TraceCheckUtils]: 132: Hoare triple {14284#(< ~counter~0 20)} assume !!(0 != ~y3~0); {14284#(< ~counter~0 20)} is VALID [2022-04-28 13:57:20,571 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {13831#true} {14284#(< ~counter~0 20)} #63#return; {14284#(< ~counter~0 20)} is VALID [2022-04-28 13:57:20,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,571 INFO L290 TraceCheckUtils]: 129: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,571 INFO L290 TraceCheckUtils]: 128: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,571 INFO L272 TraceCheckUtils]: 127: Hoare triple {14284#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,571 INFO L290 TraceCheckUtils]: 126: Hoare triple {14284#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {14284#(< ~counter~0 20)} is VALID [2022-04-28 13:57:20,572 INFO L290 TraceCheckUtils]: 125: Hoare triple {14312#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14284#(< ~counter~0 20)} is VALID [2022-04-28 13:57:20,572 INFO L290 TraceCheckUtils]: 124: Hoare triple {14312#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14312#(< ~counter~0 19)} is VALID [2022-04-28 13:57:20,573 INFO L290 TraceCheckUtils]: 123: Hoare triple {14312#(< ~counter~0 19)} assume !!(0 != ~y3~0); {14312#(< ~counter~0 19)} is VALID [2022-04-28 13:57:20,573 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13831#true} {14312#(< ~counter~0 19)} #63#return; {14312#(< ~counter~0 19)} is VALID [2022-04-28 13:57:20,573 INFO L290 TraceCheckUtils]: 121: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,573 INFO L290 TraceCheckUtils]: 120: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,573 INFO L290 TraceCheckUtils]: 119: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,573 INFO L272 TraceCheckUtils]: 118: Hoare triple {14312#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,574 INFO L290 TraceCheckUtils]: 117: Hoare triple {14312#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {14312#(< ~counter~0 19)} is VALID [2022-04-28 13:57:20,574 INFO L290 TraceCheckUtils]: 116: Hoare triple {14340#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14312#(< ~counter~0 19)} is VALID [2022-04-28 13:57:20,574 INFO L290 TraceCheckUtils]: 115: Hoare triple {14340#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14340#(< ~counter~0 18)} is VALID [2022-04-28 13:57:20,575 INFO L290 TraceCheckUtils]: 114: Hoare triple {14340#(< ~counter~0 18)} assume !!(0 != ~y3~0); {14340#(< ~counter~0 18)} is VALID [2022-04-28 13:57:20,575 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {13831#true} {14340#(< ~counter~0 18)} #63#return; {14340#(< ~counter~0 18)} is VALID [2022-04-28 13:57:20,575 INFO L290 TraceCheckUtils]: 112: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,575 INFO L290 TraceCheckUtils]: 111: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,575 INFO L290 TraceCheckUtils]: 110: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,575 INFO L272 TraceCheckUtils]: 109: Hoare triple {14340#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,576 INFO L290 TraceCheckUtils]: 108: Hoare triple {14340#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {14340#(< ~counter~0 18)} is VALID [2022-04-28 13:57:20,576 INFO L290 TraceCheckUtils]: 107: Hoare triple {14368#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14340#(< ~counter~0 18)} is VALID [2022-04-28 13:57:20,576 INFO L290 TraceCheckUtils]: 106: Hoare triple {14368#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14368#(< ~counter~0 17)} is VALID [2022-04-28 13:57:20,577 INFO L290 TraceCheckUtils]: 105: Hoare triple {14368#(< ~counter~0 17)} assume !!(0 != ~y3~0); {14368#(< ~counter~0 17)} is VALID [2022-04-28 13:57:20,577 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {13831#true} {14368#(< ~counter~0 17)} #63#return; {14368#(< ~counter~0 17)} is VALID [2022-04-28 13:57:20,577 INFO L290 TraceCheckUtils]: 103: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,577 INFO L290 TraceCheckUtils]: 102: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,577 INFO L290 TraceCheckUtils]: 101: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,577 INFO L272 TraceCheckUtils]: 100: Hoare triple {14368#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,578 INFO L290 TraceCheckUtils]: 99: Hoare triple {14368#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {14368#(< ~counter~0 17)} is VALID [2022-04-28 13:57:20,578 INFO L290 TraceCheckUtils]: 98: Hoare triple {14396#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14368#(< ~counter~0 17)} is VALID [2022-04-28 13:57:20,578 INFO L290 TraceCheckUtils]: 97: Hoare triple {14396#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14396#(< ~counter~0 16)} is VALID [2022-04-28 13:57:20,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {14396#(< ~counter~0 16)} assume !!(0 != ~y3~0); {14396#(< ~counter~0 16)} is VALID [2022-04-28 13:57:20,579 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {13831#true} {14396#(< ~counter~0 16)} #63#return; {14396#(< ~counter~0 16)} is VALID [2022-04-28 13:57:20,579 INFO L290 TraceCheckUtils]: 94: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,579 INFO L290 TraceCheckUtils]: 93: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,579 INFO L290 TraceCheckUtils]: 92: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,579 INFO L272 TraceCheckUtils]: 91: Hoare triple {14396#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,580 INFO L290 TraceCheckUtils]: 90: Hoare triple {14396#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {14396#(< ~counter~0 16)} is VALID [2022-04-28 13:57:20,580 INFO L290 TraceCheckUtils]: 89: Hoare triple {14424#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14396#(< ~counter~0 16)} is VALID [2022-04-28 13:57:20,580 INFO L290 TraceCheckUtils]: 88: Hoare triple {14424#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14424#(< ~counter~0 15)} is VALID [2022-04-28 13:57:20,581 INFO L290 TraceCheckUtils]: 87: Hoare triple {14424#(< ~counter~0 15)} assume !!(0 != ~y3~0); {14424#(< ~counter~0 15)} is VALID [2022-04-28 13:57:20,581 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13831#true} {14424#(< ~counter~0 15)} #63#return; {14424#(< ~counter~0 15)} is VALID [2022-04-28 13:57:20,581 INFO L290 TraceCheckUtils]: 85: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,581 INFO L290 TraceCheckUtils]: 84: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,581 INFO L290 TraceCheckUtils]: 83: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,581 INFO L272 TraceCheckUtils]: 82: Hoare triple {14424#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {14424#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {14424#(< ~counter~0 15)} is VALID [2022-04-28 13:57:20,582 INFO L290 TraceCheckUtils]: 80: Hoare triple {14224#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14424#(< ~counter~0 15)} is VALID [2022-04-28 13:57:20,582 INFO L290 TraceCheckUtils]: 79: Hoare triple {14224#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:20,582 INFO L290 TraceCheckUtils]: 78: Hoare triple {14224#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:20,583 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13831#true} {14224#(<= ~counter~0 13)} #63#return; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:20,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,583 INFO L272 TraceCheckUtils]: 73: Hoare triple {14224#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {14224#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:20,584 INFO L290 TraceCheckUtils]: 71: Hoare triple {14196#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14224#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:20,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {14196#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:20,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {14196#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:20,585 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13831#true} {14196#(<= ~counter~0 12)} #63#return; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:20,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,585 INFO L272 TraceCheckUtils]: 64: Hoare triple {14196#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {14196#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:20,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {14168#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14196#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:20,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {14168#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:20,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {14168#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:20,587 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13831#true} {14168#(<= ~counter~0 11)} #63#return; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:20,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,587 INFO L272 TraceCheckUtils]: 55: Hoare triple {14168#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {14168#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:20,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {14140#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14168#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:20,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {14140#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:20,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {14140#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:20,589 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13831#true} {14140#(<= ~counter~0 10)} #63#return; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:20,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,589 INFO L272 TraceCheckUtils]: 46: Hoare triple {14140#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {14140#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:20,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {14112#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14140#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:20,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {14112#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:20,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {14112#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:20,591 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13831#true} {14112#(<= ~counter~0 9)} #63#return; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:20,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,591 INFO L272 TraceCheckUtils]: 37: Hoare triple {14112#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {14112#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:20,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {14084#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14112#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:20,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {14084#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:20,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {14084#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:20,593 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13831#true} {14084#(<= ~counter~0 8)} #63#return; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:20,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,593 INFO L272 TraceCheckUtils]: 28: Hoare triple {14084#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {14084#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:20,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {14056#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14084#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:20,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {14056#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:20,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {14056#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:20,595 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13831#true} {14056#(<= ~counter~0 7)} #63#return; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:20,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {14056#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {14056#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:20,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {14028#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14056#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:20,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {14028#(<= ~counter~0 6)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13831#true} {14028#(<= ~counter~0 6)} #61#return; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L272 TraceCheckUtils]: 11: Hoare triple {14028#(<= ~counter~0 6)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13831#true} {14028#(<= ~counter~0 6)} #59#return; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {13831#true} assume true; {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {13831#true} assume !(0 == ~cond); {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {13831#true} ~cond := #in~cond; {13831#true} is VALID [2022-04-28 13:57:20,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {14028#(<= ~counter~0 6)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {13831#true} is VALID [2022-04-28 13:57:20,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {14028#(<= ~counter~0 6)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {14028#(<= ~counter~0 6)} call #t~ret7 := main(); {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14028#(<= ~counter~0 6)} {13831#true} #67#return; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {14028#(<= ~counter~0 6)} assume true; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {13831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14028#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:20,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {13831#true} call ULTIMATE.init(); {13831#true} is VALID [2022-04-28 13:57:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 26 proven. 416 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 13:57:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190524124] [2022-04-28 13:57:20,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534129058] [2022-04-28 13:57:20,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534129058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:20,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:20,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-28 13:57:20,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559576602] [2022-04-28 13:57:20,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559576602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:20,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:20,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 13:57:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539568954] [2022-04-28 13:57:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 140 [2022-04-28 13:57:20,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:20,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 13:57:20,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:20,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 13:57:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:20,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 13:57:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:20,694 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 13:57:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:21,262 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-04-28 13:57:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 13:57:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 140 [2022-04-28 13:57:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 13:57:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 165 transitions. [2022-04-28 13:57:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 13:57:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 165 transitions. [2022-04-28 13:57:21,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 165 transitions. [2022-04-28 13:57:21,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:21,405 INFO L225 Difference]: With dead ends: 151 [2022-04-28 13:57:21,405 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 13:57:21,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=535, Invalid=797, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 13:57:21,406 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:21,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 180 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 13:57:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 13:57:21,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:21,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 13:57:21,586 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 13:57:21,586 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 13:57:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:21,589 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-04-28 13:57:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-28 13:57:21,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:21,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:21,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 146 states. [2022-04-28 13:57:21,590 INFO L87 Difference]: Start difference. First operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 146 states. [2022-04-28 13:57:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:21,592 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-04-28 13:57:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-28 13:57:21,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:21,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:21,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:21,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 13:57:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2022-04-28 13:57:21,596 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 140 [2022-04-28 13:57:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:21,596 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2022-04-28 13:57:21,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 13:57:21,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 161 transitions. [2022-04-28 13:57:21,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-28 13:57:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 13:57:21,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:21,798 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:21,817 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 13:57:21,998 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 13:57:21,998 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1088976298, now seen corresponding path program 27 times [2022-04-28 13:57:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1712774546] [2022-04-28 13:57:21,999 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1088976298, now seen corresponding path program 28 times [2022-04-28 13:57:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002942872] [2022-04-28 13:57:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:22,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:22,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502406583] [2022-04-28 13:57:22,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:22,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:22,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:22,026 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 13:57:22,039 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 13:57:22,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:22,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:22,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 13:57:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:22,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:22,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {15606#true} call ULTIMATE.init(); {15606#true} is VALID [2022-04-28 13:57:22,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {15606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {15614#(<= ~counter~0 0)} assume true; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15614#(<= ~counter~0 0)} {15606#true} #67#return; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {15614#(<= ~counter~0 0)} call #t~ret7 := main(); {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {15614#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {15614#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {15614#(<= ~counter~0 0)} ~cond := #in~cond; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {15614#(<= ~counter~0 0)} assume !(0 == ~cond); {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {15614#(<= ~counter~0 0)} assume true; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15614#(<= ~counter~0 0)} {15614#(<= ~counter~0 0)} #59#return; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {15614#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {15614#(<= ~counter~0 0)} ~cond := #in~cond; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {15614#(<= ~counter~0 0)} assume !(0 == ~cond); {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {15614#(<= ~counter~0 0)} assume true; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,846 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15614#(<= ~counter~0 0)} {15614#(<= ~counter~0 0)} #61#return; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {15614#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {15614#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:22,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {15614#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {15663#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,848 INFO L272 TraceCheckUtils]: 19: Hoare triple {15663#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {15663#(<= ~counter~0 1)} ~cond := #in~cond; {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {15663#(<= ~counter~0 1)} assume !(0 == ~cond); {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {15663#(<= ~counter~0 1)} assume true; {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,849 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15663#(<= ~counter~0 1)} {15663#(<= ~counter~0 1)} #63#return; {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {15663#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {15663#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15663#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:22,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {15663#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {15691#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,851 INFO L272 TraceCheckUtils]: 28: Hoare triple {15691#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {15691#(<= ~counter~0 2)} ~cond := #in~cond; {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {15691#(<= ~counter~0 2)} assume !(0 == ~cond); {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {15691#(<= ~counter~0 2)} assume true; {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,852 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15691#(<= ~counter~0 2)} {15691#(<= ~counter~0 2)} #63#return; {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {15691#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {15691#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15691#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:22,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {15691#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {15719#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,854 INFO L272 TraceCheckUtils]: 37: Hoare triple {15719#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {15719#(<= ~counter~0 3)} ~cond := #in~cond; {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {15719#(<= ~counter~0 3)} assume !(0 == ~cond); {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {15719#(<= ~counter~0 3)} assume true; {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,855 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15719#(<= ~counter~0 3)} {15719#(<= ~counter~0 3)} #63#return; {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {15719#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {15719#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15719#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:22,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {15719#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {15747#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,857 INFO L272 TraceCheckUtils]: 46: Hoare triple {15747#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {15747#(<= ~counter~0 4)} ~cond := #in~cond; {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {15747#(<= ~counter~0 4)} assume !(0 == ~cond); {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {15747#(<= ~counter~0 4)} assume true; {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,858 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15747#(<= ~counter~0 4)} {15747#(<= ~counter~0 4)} #63#return; {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {15747#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {15747#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15747#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:22,859 INFO L290 TraceCheckUtils]: 53: Hoare triple {15747#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {15775#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,860 INFO L272 TraceCheckUtils]: 55: Hoare triple {15775#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {15775#(<= ~counter~0 5)} ~cond := #in~cond; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {15775#(<= ~counter~0 5)} assume !(0 == ~cond); {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {15775#(<= ~counter~0 5)} assume true; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,861 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15775#(<= ~counter~0 5)} {15775#(<= ~counter~0 5)} #63#return; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {15775#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {15775#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:22,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {15775#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {15803#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,863 INFO L272 TraceCheckUtils]: 64: Hoare triple {15803#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {15803#(<= ~counter~0 6)} ~cond := #in~cond; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {15803#(<= ~counter~0 6)} assume !(0 == ~cond); {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {15803#(<= ~counter~0 6)} assume true; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,865 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15803#(<= ~counter~0 6)} {15803#(<= ~counter~0 6)} #63#return; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {15803#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {15803#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:22,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {15803#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {15831#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,866 INFO L272 TraceCheckUtils]: 73: Hoare triple {15831#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {15831#(<= ~counter~0 7)} ~cond := #in~cond; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {15831#(<= ~counter~0 7)} assume !(0 == ~cond); {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {15831#(<= ~counter~0 7)} assume true; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,868 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15831#(<= ~counter~0 7)} {15831#(<= ~counter~0 7)} #63#return; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,868 INFO L290 TraceCheckUtils]: 78: Hoare triple {15831#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,868 INFO L290 TraceCheckUtils]: 79: Hoare triple {15831#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:22,869 INFO L290 TraceCheckUtils]: 80: Hoare triple {15831#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,869 INFO L290 TraceCheckUtils]: 81: Hoare triple {15859#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,869 INFO L272 TraceCheckUtils]: 82: Hoare triple {15859#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,870 INFO L290 TraceCheckUtils]: 83: Hoare triple {15859#(<= ~counter~0 8)} ~cond := #in~cond; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,870 INFO L290 TraceCheckUtils]: 84: Hoare triple {15859#(<= ~counter~0 8)} assume !(0 == ~cond); {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,870 INFO L290 TraceCheckUtils]: 85: Hoare triple {15859#(<= ~counter~0 8)} assume true; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,871 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15859#(<= ~counter~0 8)} {15859#(<= ~counter~0 8)} #63#return; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {15859#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,871 INFO L290 TraceCheckUtils]: 88: Hoare triple {15859#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:22,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {15859#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {15887#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,872 INFO L272 TraceCheckUtils]: 91: Hoare triple {15887#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,873 INFO L290 TraceCheckUtils]: 92: Hoare triple {15887#(<= ~counter~0 9)} ~cond := #in~cond; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {15887#(<= ~counter~0 9)} assume !(0 == ~cond); {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {15887#(<= ~counter~0 9)} assume true; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,874 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15887#(<= ~counter~0 9)} {15887#(<= ~counter~0 9)} #63#return; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {15887#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {15887#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:22,875 INFO L290 TraceCheckUtils]: 98: Hoare triple {15887#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,875 INFO L290 TraceCheckUtils]: 99: Hoare triple {15915#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,876 INFO L272 TraceCheckUtils]: 100: Hoare triple {15915#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,876 INFO L290 TraceCheckUtils]: 101: Hoare triple {15915#(<= ~counter~0 10)} ~cond := #in~cond; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,876 INFO L290 TraceCheckUtils]: 102: Hoare triple {15915#(<= ~counter~0 10)} assume !(0 == ~cond); {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,876 INFO L290 TraceCheckUtils]: 103: Hoare triple {15915#(<= ~counter~0 10)} assume true; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,877 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15915#(<= ~counter~0 10)} {15915#(<= ~counter~0 10)} #63#return; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,877 INFO L290 TraceCheckUtils]: 105: Hoare triple {15915#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,877 INFO L290 TraceCheckUtils]: 106: Hoare triple {15915#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:22,878 INFO L290 TraceCheckUtils]: 107: Hoare triple {15915#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,878 INFO L290 TraceCheckUtils]: 108: Hoare triple {15943#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,879 INFO L272 TraceCheckUtils]: 109: Hoare triple {15943#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,879 INFO L290 TraceCheckUtils]: 110: Hoare triple {15943#(<= ~counter~0 11)} ~cond := #in~cond; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,879 INFO L290 TraceCheckUtils]: 111: Hoare triple {15943#(<= ~counter~0 11)} assume !(0 == ~cond); {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,879 INFO L290 TraceCheckUtils]: 112: Hoare triple {15943#(<= ~counter~0 11)} assume true; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,880 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {15943#(<= ~counter~0 11)} {15943#(<= ~counter~0 11)} #63#return; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {15943#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {15943#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:22,881 INFO L290 TraceCheckUtils]: 116: Hoare triple {15943#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,881 INFO L290 TraceCheckUtils]: 117: Hoare triple {15971#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,882 INFO L272 TraceCheckUtils]: 118: Hoare triple {15971#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,882 INFO L290 TraceCheckUtils]: 119: Hoare triple {15971#(<= ~counter~0 12)} ~cond := #in~cond; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,882 INFO L290 TraceCheckUtils]: 120: Hoare triple {15971#(<= ~counter~0 12)} assume !(0 == ~cond); {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,883 INFO L290 TraceCheckUtils]: 121: Hoare triple {15971#(<= ~counter~0 12)} assume true; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,883 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15971#(<= ~counter~0 12)} {15971#(<= ~counter~0 12)} #63#return; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {15971#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,884 INFO L290 TraceCheckUtils]: 124: Hoare triple {15971#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:22,884 INFO L290 TraceCheckUtils]: 125: Hoare triple {15971#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,884 INFO L290 TraceCheckUtils]: 126: Hoare triple {15999#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,885 INFO L272 TraceCheckUtils]: 127: Hoare triple {15999#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,885 INFO L290 TraceCheckUtils]: 128: Hoare triple {15999#(<= ~counter~0 13)} ~cond := #in~cond; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,885 INFO L290 TraceCheckUtils]: 129: Hoare triple {15999#(<= ~counter~0 13)} assume !(0 == ~cond); {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,886 INFO L290 TraceCheckUtils]: 130: Hoare triple {15999#(<= ~counter~0 13)} assume true; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,886 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {15999#(<= ~counter~0 13)} {15999#(<= ~counter~0 13)} #63#return; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,886 INFO L290 TraceCheckUtils]: 132: Hoare triple {15999#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,887 INFO L290 TraceCheckUtils]: 133: Hoare triple {15999#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:22,887 INFO L290 TraceCheckUtils]: 134: Hoare triple {15999#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,887 INFO L290 TraceCheckUtils]: 135: Hoare triple {16027#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,888 INFO L272 TraceCheckUtils]: 136: Hoare triple {16027#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,888 INFO L290 TraceCheckUtils]: 137: Hoare triple {16027#(<= ~counter~0 14)} ~cond := #in~cond; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,888 INFO L290 TraceCheckUtils]: 138: Hoare triple {16027#(<= ~counter~0 14)} assume !(0 == ~cond); {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,889 INFO L290 TraceCheckUtils]: 139: Hoare triple {16027#(<= ~counter~0 14)} assume true; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,897 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {16027#(<= ~counter~0 14)} {16027#(<= ~counter~0 14)} #63#return; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,897 INFO L290 TraceCheckUtils]: 141: Hoare triple {16027#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,897 INFO L290 TraceCheckUtils]: 142: Hoare triple {16027#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:22,898 INFO L290 TraceCheckUtils]: 143: Hoare triple {16027#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16055#(<= |main_#t~post6| 14)} is VALID [2022-04-28 13:57:22,898 INFO L290 TraceCheckUtils]: 144: Hoare triple {16055#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {15607#false} is VALID [2022-04-28 13:57:22,898 INFO L272 TraceCheckUtils]: 145: Hoare triple {15607#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {15607#false} is VALID [2022-04-28 13:57:22,898 INFO L290 TraceCheckUtils]: 146: Hoare triple {15607#false} ~cond := #in~cond; {15607#false} is VALID [2022-04-28 13:57:22,898 INFO L290 TraceCheckUtils]: 147: Hoare triple {15607#false} assume 0 == ~cond; {15607#false} is VALID [2022-04-28 13:57:22,898 INFO L290 TraceCheckUtils]: 148: Hoare triple {15607#false} assume !false; {15607#false} is VALID [2022-04-28 13:57:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 28 proven. 847 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:22,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:23,562 INFO L290 TraceCheckUtils]: 148: Hoare triple {15607#false} assume !false; {15607#false} is VALID [2022-04-28 13:57:23,562 INFO L290 TraceCheckUtils]: 147: Hoare triple {15607#false} assume 0 == ~cond; {15607#false} is VALID [2022-04-28 13:57:23,562 INFO L290 TraceCheckUtils]: 146: Hoare triple {15607#false} ~cond := #in~cond; {15607#false} is VALID [2022-04-28 13:57:23,562 INFO L272 TraceCheckUtils]: 145: Hoare triple {15607#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {15607#false} is VALID [2022-04-28 13:57:23,562 INFO L290 TraceCheckUtils]: 144: Hoare triple {16083#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {15607#false} is VALID [2022-04-28 13:57:23,563 INFO L290 TraceCheckUtils]: 143: Hoare triple {16087#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16083#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:23,563 INFO L290 TraceCheckUtils]: 142: Hoare triple {16087#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16087#(< ~counter~0 20)} is VALID [2022-04-28 13:57:23,563 INFO L290 TraceCheckUtils]: 141: Hoare triple {16087#(< ~counter~0 20)} assume !!(0 != ~y3~0); {16087#(< ~counter~0 20)} is VALID [2022-04-28 13:57:23,564 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {15606#true} {16087#(< ~counter~0 20)} #63#return; {16087#(< ~counter~0 20)} is VALID [2022-04-28 13:57:23,564 INFO L290 TraceCheckUtils]: 139: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,564 INFO L290 TraceCheckUtils]: 138: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,564 INFO L290 TraceCheckUtils]: 137: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,564 INFO L272 TraceCheckUtils]: 136: Hoare triple {16087#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,564 INFO L290 TraceCheckUtils]: 135: Hoare triple {16087#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {16087#(< ~counter~0 20)} is VALID [2022-04-28 13:57:23,565 INFO L290 TraceCheckUtils]: 134: Hoare triple {16115#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16087#(< ~counter~0 20)} is VALID [2022-04-28 13:57:23,565 INFO L290 TraceCheckUtils]: 133: Hoare triple {16115#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16115#(< ~counter~0 19)} is VALID [2022-04-28 13:57:23,565 INFO L290 TraceCheckUtils]: 132: Hoare triple {16115#(< ~counter~0 19)} assume !!(0 != ~y3~0); {16115#(< ~counter~0 19)} is VALID [2022-04-28 13:57:23,566 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {15606#true} {16115#(< ~counter~0 19)} #63#return; {16115#(< ~counter~0 19)} is VALID [2022-04-28 13:57:23,566 INFO L290 TraceCheckUtils]: 130: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,566 INFO L290 TraceCheckUtils]: 129: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,566 INFO L290 TraceCheckUtils]: 128: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,566 INFO L272 TraceCheckUtils]: 127: Hoare triple {16115#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,566 INFO L290 TraceCheckUtils]: 126: Hoare triple {16115#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {16115#(< ~counter~0 19)} is VALID [2022-04-28 13:57:23,567 INFO L290 TraceCheckUtils]: 125: Hoare triple {16143#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16115#(< ~counter~0 19)} is VALID [2022-04-28 13:57:23,567 INFO L290 TraceCheckUtils]: 124: Hoare triple {16143#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16143#(< ~counter~0 18)} is VALID [2022-04-28 13:57:23,567 INFO L290 TraceCheckUtils]: 123: Hoare triple {16143#(< ~counter~0 18)} assume !!(0 != ~y3~0); {16143#(< ~counter~0 18)} is VALID [2022-04-28 13:57:23,568 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15606#true} {16143#(< ~counter~0 18)} #63#return; {16143#(< ~counter~0 18)} is VALID [2022-04-28 13:57:23,568 INFO L290 TraceCheckUtils]: 121: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,568 INFO L290 TraceCheckUtils]: 120: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,568 INFO L290 TraceCheckUtils]: 119: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,568 INFO L272 TraceCheckUtils]: 118: Hoare triple {16143#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,568 INFO L290 TraceCheckUtils]: 117: Hoare triple {16143#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {16143#(< ~counter~0 18)} is VALID [2022-04-28 13:57:23,569 INFO L290 TraceCheckUtils]: 116: Hoare triple {16171#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16143#(< ~counter~0 18)} is VALID [2022-04-28 13:57:23,569 INFO L290 TraceCheckUtils]: 115: Hoare triple {16171#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16171#(< ~counter~0 17)} is VALID [2022-04-28 13:57:23,569 INFO L290 TraceCheckUtils]: 114: Hoare triple {16171#(< ~counter~0 17)} assume !!(0 != ~y3~0); {16171#(< ~counter~0 17)} is VALID [2022-04-28 13:57:23,571 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {15606#true} {16171#(< ~counter~0 17)} #63#return; {16171#(< ~counter~0 17)} is VALID [2022-04-28 13:57:23,572 INFO L290 TraceCheckUtils]: 112: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,572 INFO L290 TraceCheckUtils]: 111: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,572 INFO L290 TraceCheckUtils]: 110: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,572 INFO L272 TraceCheckUtils]: 109: Hoare triple {16171#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,572 INFO L290 TraceCheckUtils]: 108: Hoare triple {16171#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {16171#(< ~counter~0 17)} is VALID [2022-04-28 13:57:23,573 INFO L290 TraceCheckUtils]: 107: Hoare triple {16199#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16171#(< ~counter~0 17)} is VALID [2022-04-28 13:57:23,573 INFO L290 TraceCheckUtils]: 106: Hoare triple {16199#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16199#(< ~counter~0 16)} is VALID [2022-04-28 13:57:23,573 INFO L290 TraceCheckUtils]: 105: Hoare triple {16199#(< ~counter~0 16)} assume !!(0 != ~y3~0); {16199#(< ~counter~0 16)} is VALID [2022-04-28 13:57:23,574 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15606#true} {16199#(< ~counter~0 16)} #63#return; {16199#(< ~counter~0 16)} is VALID [2022-04-28 13:57:23,574 INFO L290 TraceCheckUtils]: 103: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,574 INFO L290 TraceCheckUtils]: 102: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,574 INFO L290 TraceCheckUtils]: 101: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,574 INFO L272 TraceCheckUtils]: 100: Hoare triple {16199#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {16199#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {16199#(< ~counter~0 16)} is VALID [2022-04-28 13:57:23,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {16027#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16199#(< ~counter~0 16)} is VALID [2022-04-28 13:57:23,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {16027#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:23,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {16027#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:23,577 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15606#true} {16027#(<= ~counter~0 14)} #63#return; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:23,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,577 INFO L272 TraceCheckUtils]: 91: Hoare triple {16027#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,577 INFO L290 TraceCheckUtils]: 90: Hoare triple {16027#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:23,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {15999#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16027#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:23,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {15999#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:23,579 INFO L290 TraceCheckUtils]: 87: Hoare triple {15999#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:23,579 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15606#true} {15999#(<= ~counter~0 13)} #63#return; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:23,580 INFO L290 TraceCheckUtils]: 85: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,580 INFO L290 TraceCheckUtils]: 84: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,580 INFO L290 TraceCheckUtils]: 83: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,580 INFO L272 TraceCheckUtils]: 82: Hoare triple {15999#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,580 INFO L290 TraceCheckUtils]: 81: Hoare triple {15999#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:23,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {15971#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15999#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:23,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {15971#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:23,581 INFO L290 TraceCheckUtils]: 78: Hoare triple {15971#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:23,582 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15606#true} {15971#(<= ~counter~0 12)} #63#return; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:23,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,582 INFO L272 TraceCheckUtils]: 73: Hoare triple {15971#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {15971#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:23,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {15943#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15971#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:23,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {15943#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:23,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {15943#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:23,585 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15606#true} {15943#(<= ~counter~0 11)} #63#return; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:23,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,585 INFO L272 TraceCheckUtils]: 64: Hoare triple {15943#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {15943#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:23,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {15915#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15943#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:23,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {15915#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:23,587 INFO L290 TraceCheckUtils]: 60: Hoare triple {15915#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:23,587 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15606#true} {15915#(<= ~counter~0 10)} #63#return; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:23,587 INFO L290 TraceCheckUtils]: 58: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,588 INFO L272 TraceCheckUtils]: 55: Hoare triple {15915#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {15915#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:23,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {15887#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15915#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:23,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {15887#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:23,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {15887#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:23,590 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15606#true} {15887#(<= ~counter~0 9)} #63#return; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:23,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,590 INFO L272 TraceCheckUtils]: 46: Hoare triple {15887#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {15887#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:23,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {15859#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15887#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:23,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {15859#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:23,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {15859#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:23,592 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15606#true} {15859#(<= ~counter~0 8)} #63#return; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:23,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,593 INFO L272 TraceCheckUtils]: 37: Hoare triple {15859#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {15859#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:23,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {15831#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15859#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:23,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {15831#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:23,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {15831#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:23,595 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15606#true} {15831#(<= ~counter~0 7)} #63#return; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:23,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,595 INFO L272 TraceCheckUtils]: 28: Hoare triple {15831#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {15831#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:23,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {15803#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15831#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:23,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {15803#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:23,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {15803#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:23,597 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15606#true} {15803#(<= ~counter~0 6)} #63#return; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:23,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,598 INFO L272 TraceCheckUtils]: 19: Hoare triple {15803#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {15803#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:23,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {15775#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15803#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:23,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {15775#(<= ~counter~0 5)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,599 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15606#true} {15775#(<= ~counter~0 5)} #61#return; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,600 INFO L272 TraceCheckUtils]: 11: Hoare triple {15775#(<= ~counter~0 5)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15606#true} {15775#(<= ~counter~0 5)} #59#return; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {15606#true} assume true; {15606#true} is VALID [2022-04-28 13:57:23,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {15606#true} assume !(0 == ~cond); {15606#true} is VALID [2022-04-28 13:57:23,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {15606#true} ~cond := #in~cond; {15606#true} is VALID [2022-04-28 13:57:23,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {15775#(<= ~counter~0 5)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {15606#true} is VALID [2022-04-28 13:57:23,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {15775#(<= ~counter~0 5)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {15775#(<= ~counter~0 5)} call #t~ret7 := main(); {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15775#(<= ~counter~0 5)} {15606#true} #67#return; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {15775#(<= ~counter~0 5)} assume true; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {15606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15775#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:23,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {15606#true} call ULTIMATE.init(); {15606#true} is VALID [2022-04-28 13:57:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 28 proven. 483 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 13:57:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002942872] [2022-04-28 13:57:23,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502406583] [2022-04-28 13:57:23,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502406583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:23,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:23,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-28 13:57:23,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:23,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1712774546] [2022-04-28 13:57:23,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1712774546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:23,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:23,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 13:57:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821576219] [2022-04-28 13:57:23,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:23,605 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 149 [2022-04-28 13:57:23,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:23,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 13:57:23,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:23,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 13:57:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 13:57:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:23,703 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 13:57:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:24,262 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-04-28 13:57:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 13:57:24,262 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 149 [2022-04-28 13:57:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 13:57:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 175 transitions. [2022-04-28 13:57:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 13:57:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 175 transitions. [2022-04-28 13:57:24,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 175 transitions. [2022-04-28 13:57:24,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:24,407 INFO L225 Difference]: With dead ends: 160 [2022-04-28 13:57:24,407 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 13:57:24,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=558, Invalid=848, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 13:57:24,408 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:24,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 194 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 13:57:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-04-28 13:57:24,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:24,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:57:24,588 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:57:24,588 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:57:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:24,591 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-28 13:57:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-28 13:57:24,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:24,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:24,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 155 states. [2022-04-28 13:57:24,592 INFO L87 Difference]: Start difference. First operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 155 states. [2022-04-28 13:57:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:24,594 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-28 13:57:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-28 13:57:24,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:24,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:24,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:24,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 13:57:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2022-04-28 13:57:24,598 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 149 [2022-04-28 13:57:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:24,598 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2022-04-28 13:57:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 13:57:24,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 171 transitions. [2022-04-28 13:57:24,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-28 13:57:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-28 13:57:24,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:24,806 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:24,825 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 13:57:25,007 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 13:57:25,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:25,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2060864036, now seen corresponding path program 29 times [2022-04-28 13:57:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:25,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826002588] [2022-04-28 13:57:25,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2060864036, now seen corresponding path program 30 times [2022-04-28 13:57:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:25,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323344890] [2022-04-28 13:57:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:25,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:25,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:25,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361631505] [2022-04-28 13:57:25,022 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:57:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:25,023 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 13:57:25,026 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 13:57:25,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 13:57:25,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:25,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 13:57:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:25,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:25,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17491#true} is VALID [2022-04-28 13:57:25,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {17499#(<= ~counter~0 0)} assume true; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17499#(<= ~counter~0 0)} {17491#true} #67#return; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {17499#(<= ~counter~0 0)} call #t~ret7 := main(); {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {17499#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {17499#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {17499#(<= ~counter~0 0)} ~cond := #in~cond; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {17499#(<= ~counter~0 0)} assume !(0 == ~cond); {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {17499#(<= ~counter~0 0)} assume true; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17499#(<= ~counter~0 0)} {17499#(<= ~counter~0 0)} #59#return; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,938 INFO L272 TraceCheckUtils]: 11: Hoare triple {17499#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {17499#(<= ~counter~0 0)} ~cond := #in~cond; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {17499#(<= ~counter~0 0)} assume !(0 == ~cond); {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {17499#(<= ~counter~0 0)} assume true; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,939 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17499#(<= ~counter~0 0)} {17499#(<= ~counter~0 0)} #61#return; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {17499#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {17499#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:25,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {17499#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {17548#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {17548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {17548#(<= ~counter~0 1)} ~cond := #in~cond; {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {17548#(<= ~counter~0 1)} assume !(0 == ~cond); {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {17548#(<= ~counter~0 1)} assume true; {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,943 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17548#(<= ~counter~0 1)} {17548#(<= ~counter~0 1)} #63#return; {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {17548#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {17548#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17548#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:25,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {17548#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {17576#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,945 INFO L272 TraceCheckUtils]: 28: Hoare triple {17576#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {17576#(<= ~counter~0 2)} ~cond := #in~cond; {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {17576#(<= ~counter~0 2)} assume !(0 == ~cond); {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {17576#(<= ~counter~0 2)} assume true; {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,946 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17576#(<= ~counter~0 2)} {17576#(<= ~counter~0 2)} #63#return; {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {17576#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {17576#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17576#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:25,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {17576#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {17604#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,948 INFO L272 TraceCheckUtils]: 37: Hoare triple {17604#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {17604#(<= ~counter~0 3)} ~cond := #in~cond; {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {17604#(<= ~counter~0 3)} assume !(0 == ~cond); {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {17604#(<= ~counter~0 3)} assume true; {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,949 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17604#(<= ~counter~0 3)} {17604#(<= ~counter~0 3)} #63#return; {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {17604#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {17604#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17604#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:25,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {17604#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {17632#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,951 INFO L272 TraceCheckUtils]: 46: Hoare triple {17632#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {17632#(<= ~counter~0 4)} ~cond := #in~cond; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {17632#(<= ~counter~0 4)} assume !(0 == ~cond); {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {17632#(<= ~counter~0 4)} assume true; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,953 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17632#(<= ~counter~0 4)} {17632#(<= ~counter~0 4)} #63#return; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {17632#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {17632#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:25,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {17632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {17660#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,956 INFO L272 TraceCheckUtils]: 55: Hoare triple {17660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {17660#(<= ~counter~0 5)} ~cond := #in~cond; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {17660#(<= ~counter~0 5)} assume !(0 == ~cond); {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {17660#(<= ~counter~0 5)} assume true; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,958 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17660#(<= ~counter~0 5)} {17660#(<= ~counter~0 5)} #63#return; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {17660#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {17660#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:25,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {17660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {17688#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,960 INFO L272 TraceCheckUtils]: 64: Hoare triple {17688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {17688#(<= ~counter~0 6)} ~cond := #in~cond; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {17688#(<= ~counter~0 6)} assume !(0 == ~cond); {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {17688#(<= ~counter~0 6)} assume true; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,962 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17688#(<= ~counter~0 6)} {17688#(<= ~counter~0 6)} #63#return; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,962 INFO L290 TraceCheckUtils]: 69: Hoare triple {17688#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {17688#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:25,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {17688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {17716#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,965 INFO L272 TraceCheckUtils]: 73: Hoare triple {17716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {17716#(<= ~counter~0 7)} ~cond := #in~cond; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {17716#(<= ~counter~0 7)} assume !(0 == ~cond); {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,966 INFO L290 TraceCheckUtils]: 76: Hoare triple {17716#(<= ~counter~0 7)} assume true; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,967 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17716#(<= ~counter~0 7)} {17716#(<= ~counter~0 7)} #63#return; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {17716#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,967 INFO L290 TraceCheckUtils]: 79: Hoare triple {17716#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:25,968 INFO L290 TraceCheckUtils]: 80: Hoare triple {17716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {17744#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,968 INFO L272 TraceCheckUtils]: 82: Hoare triple {17744#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,969 INFO L290 TraceCheckUtils]: 83: Hoare triple {17744#(<= ~counter~0 8)} ~cond := #in~cond; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {17744#(<= ~counter~0 8)} assume !(0 == ~cond); {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,969 INFO L290 TraceCheckUtils]: 85: Hoare triple {17744#(<= ~counter~0 8)} assume true; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,970 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17744#(<= ~counter~0 8)} {17744#(<= ~counter~0 8)} #63#return; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,970 INFO L290 TraceCheckUtils]: 87: Hoare triple {17744#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,970 INFO L290 TraceCheckUtils]: 88: Hoare triple {17744#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:25,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {17744#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,971 INFO L290 TraceCheckUtils]: 90: Hoare triple {17772#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,972 INFO L272 TraceCheckUtils]: 91: Hoare triple {17772#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,972 INFO L290 TraceCheckUtils]: 92: Hoare triple {17772#(<= ~counter~0 9)} ~cond := #in~cond; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,972 INFO L290 TraceCheckUtils]: 93: Hoare triple {17772#(<= ~counter~0 9)} assume !(0 == ~cond); {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,972 INFO L290 TraceCheckUtils]: 94: Hoare triple {17772#(<= ~counter~0 9)} assume true; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,973 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17772#(<= ~counter~0 9)} {17772#(<= ~counter~0 9)} #63#return; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,973 INFO L290 TraceCheckUtils]: 96: Hoare triple {17772#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,973 INFO L290 TraceCheckUtils]: 97: Hoare triple {17772#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:25,974 INFO L290 TraceCheckUtils]: 98: Hoare triple {17772#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,974 INFO L290 TraceCheckUtils]: 99: Hoare triple {17800#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,975 INFO L272 TraceCheckUtils]: 100: Hoare triple {17800#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,975 INFO L290 TraceCheckUtils]: 101: Hoare triple {17800#(<= ~counter~0 10)} ~cond := #in~cond; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,975 INFO L290 TraceCheckUtils]: 102: Hoare triple {17800#(<= ~counter~0 10)} assume !(0 == ~cond); {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,976 INFO L290 TraceCheckUtils]: 103: Hoare triple {17800#(<= ~counter~0 10)} assume true; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,976 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17800#(<= ~counter~0 10)} {17800#(<= ~counter~0 10)} #63#return; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,976 INFO L290 TraceCheckUtils]: 105: Hoare triple {17800#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,977 INFO L290 TraceCheckUtils]: 106: Hoare triple {17800#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:25,977 INFO L290 TraceCheckUtils]: 107: Hoare triple {17800#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {17828#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,978 INFO L272 TraceCheckUtils]: 109: Hoare triple {17828#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,978 INFO L290 TraceCheckUtils]: 110: Hoare triple {17828#(<= ~counter~0 11)} ~cond := #in~cond; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,978 INFO L290 TraceCheckUtils]: 111: Hoare triple {17828#(<= ~counter~0 11)} assume !(0 == ~cond); {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,979 INFO L290 TraceCheckUtils]: 112: Hoare triple {17828#(<= ~counter~0 11)} assume true; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,979 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17828#(<= ~counter~0 11)} {17828#(<= ~counter~0 11)} #63#return; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,979 INFO L290 TraceCheckUtils]: 114: Hoare triple {17828#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,980 INFO L290 TraceCheckUtils]: 115: Hoare triple {17828#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:25,980 INFO L290 TraceCheckUtils]: 116: Hoare triple {17828#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,980 INFO L290 TraceCheckUtils]: 117: Hoare triple {17856#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,981 INFO L272 TraceCheckUtils]: 118: Hoare triple {17856#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,981 INFO L290 TraceCheckUtils]: 119: Hoare triple {17856#(<= ~counter~0 12)} ~cond := #in~cond; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,981 INFO L290 TraceCheckUtils]: 120: Hoare triple {17856#(<= ~counter~0 12)} assume !(0 == ~cond); {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,982 INFO L290 TraceCheckUtils]: 121: Hoare triple {17856#(<= ~counter~0 12)} assume true; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,982 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17856#(<= ~counter~0 12)} {17856#(<= ~counter~0 12)} #63#return; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,983 INFO L290 TraceCheckUtils]: 123: Hoare triple {17856#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,983 INFO L290 TraceCheckUtils]: 124: Hoare triple {17856#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:25,983 INFO L290 TraceCheckUtils]: 125: Hoare triple {17856#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,984 INFO L290 TraceCheckUtils]: 126: Hoare triple {17884#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,984 INFO L272 TraceCheckUtils]: 127: Hoare triple {17884#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,984 INFO L290 TraceCheckUtils]: 128: Hoare triple {17884#(<= ~counter~0 13)} ~cond := #in~cond; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,985 INFO L290 TraceCheckUtils]: 129: Hoare triple {17884#(<= ~counter~0 13)} assume !(0 == ~cond); {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,985 INFO L290 TraceCheckUtils]: 130: Hoare triple {17884#(<= ~counter~0 13)} assume true; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,985 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {17884#(<= ~counter~0 13)} {17884#(<= ~counter~0 13)} #63#return; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,986 INFO L290 TraceCheckUtils]: 132: Hoare triple {17884#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,987 INFO L290 TraceCheckUtils]: 133: Hoare triple {17884#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:25,987 INFO L290 TraceCheckUtils]: 134: Hoare triple {17884#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,987 INFO L290 TraceCheckUtils]: 135: Hoare triple {17912#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,988 INFO L272 TraceCheckUtils]: 136: Hoare triple {17912#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,988 INFO L290 TraceCheckUtils]: 137: Hoare triple {17912#(<= ~counter~0 14)} ~cond := #in~cond; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,988 INFO L290 TraceCheckUtils]: 138: Hoare triple {17912#(<= ~counter~0 14)} assume !(0 == ~cond); {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,989 INFO L290 TraceCheckUtils]: 139: Hoare triple {17912#(<= ~counter~0 14)} assume true; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,989 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17912#(<= ~counter~0 14)} {17912#(<= ~counter~0 14)} #63#return; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,989 INFO L290 TraceCheckUtils]: 141: Hoare triple {17912#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,990 INFO L290 TraceCheckUtils]: 142: Hoare triple {17912#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:25,990 INFO L290 TraceCheckUtils]: 143: Hoare triple {17912#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,990 INFO L290 TraceCheckUtils]: 144: Hoare triple {17940#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,991 INFO L272 TraceCheckUtils]: 145: Hoare triple {17940#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,991 INFO L290 TraceCheckUtils]: 146: Hoare triple {17940#(<= ~counter~0 15)} ~cond := #in~cond; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,991 INFO L290 TraceCheckUtils]: 147: Hoare triple {17940#(<= ~counter~0 15)} assume !(0 == ~cond); {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,992 INFO L290 TraceCheckUtils]: 148: Hoare triple {17940#(<= ~counter~0 15)} assume true; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,992 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {17940#(<= ~counter~0 15)} {17940#(<= ~counter~0 15)} #63#return; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,993 INFO L290 TraceCheckUtils]: 150: Hoare triple {17940#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,993 INFO L290 TraceCheckUtils]: 151: Hoare triple {17940#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:25,993 INFO L290 TraceCheckUtils]: 152: Hoare triple {17940#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17968#(<= |main_#t~post6| 15)} is VALID [2022-04-28 13:57:25,993 INFO L290 TraceCheckUtils]: 153: Hoare triple {17968#(<= |main_#t~post6| 15)} assume !(#t~post6 < 20);havoc #t~post6; {17492#false} is VALID [2022-04-28 13:57:25,993 INFO L272 TraceCheckUtils]: 154: Hoare triple {17492#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {17492#false} is VALID [2022-04-28 13:57:25,994 INFO L290 TraceCheckUtils]: 155: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID [2022-04-28 13:57:25,994 INFO L290 TraceCheckUtils]: 156: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID [2022-04-28 13:57:25,994 INFO L290 TraceCheckUtils]: 157: Hoare triple {17492#false} assume !false; {17492#false} is VALID [2022-04-28 13:57:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 30 proven. 975 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:25,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:26,753 INFO L290 TraceCheckUtils]: 157: Hoare triple {17492#false} assume !false; {17492#false} is VALID [2022-04-28 13:57:26,753 INFO L290 TraceCheckUtils]: 156: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID [2022-04-28 13:57:26,753 INFO L290 TraceCheckUtils]: 155: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID [2022-04-28 13:57:26,754 INFO L272 TraceCheckUtils]: 154: Hoare triple {17492#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {17492#false} is VALID [2022-04-28 13:57:26,754 INFO L290 TraceCheckUtils]: 153: Hoare triple {17996#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {17492#false} is VALID [2022-04-28 13:57:26,754 INFO L290 TraceCheckUtils]: 152: Hoare triple {18000#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17996#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:26,755 INFO L290 TraceCheckUtils]: 151: Hoare triple {18000#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {18000#(< ~counter~0 20)} is VALID [2022-04-28 13:57:26,755 INFO L290 TraceCheckUtils]: 150: Hoare triple {18000#(< ~counter~0 20)} assume !!(0 != ~y3~0); {18000#(< ~counter~0 20)} is VALID [2022-04-28 13:57:26,756 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {17491#true} {18000#(< ~counter~0 20)} #63#return; {18000#(< ~counter~0 20)} is VALID [2022-04-28 13:57:26,756 INFO L290 TraceCheckUtils]: 148: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,756 INFO L290 TraceCheckUtils]: 147: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,756 INFO L290 TraceCheckUtils]: 146: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,756 INFO L272 TraceCheckUtils]: 145: Hoare triple {18000#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,756 INFO L290 TraceCheckUtils]: 144: Hoare triple {18000#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {18000#(< ~counter~0 20)} is VALID [2022-04-28 13:57:26,757 INFO L290 TraceCheckUtils]: 143: Hoare triple {18028#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18000#(< ~counter~0 20)} is VALID [2022-04-28 13:57:26,758 INFO L290 TraceCheckUtils]: 142: Hoare triple {18028#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {18028#(< ~counter~0 19)} is VALID [2022-04-28 13:57:26,758 INFO L290 TraceCheckUtils]: 141: Hoare triple {18028#(< ~counter~0 19)} assume !!(0 != ~y3~0); {18028#(< ~counter~0 19)} is VALID [2022-04-28 13:57:26,759 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17491#true} {18028#(< ~counter~0 19)} #63#return; {18028#(< ~counter~0 19)} is VALID [2022-04-28 13:57:26,759 INFO L290 TraceCheckUtils]: 139: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,759 INFO L290 TraceCheckUtils]: 138: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,759 INFO L290 TraceCheckUtils]: 137: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,759 INFO L272 TraceCheckUtils]: 136: Hoare triple {18028#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,759 INFO L290 TraceCheckUtils]: 135: Hoare triple {18028#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {18028#(< ~counter~0 19)} is VALID [2022-04-28 13:57:26,760 INFO L290 TraceCheckUtils]: 134: Hoare triple {18056#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18028#(< ~counter~0 19)} is VALID [2022-04-28 13:57:26,760 INFO L290 TraceCheckUtils]: 133: Hoare triple {18056#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {18056#(< ~counter~0 18)} is VALID [2022-04-28 13:57:26,760 INFO L290 TraceCheckUtils]: 132: Hoare triple {18056#(< ~counter~0 18)} assume !!(0 != ~y3~0); {18056#(< ~counter~0 18)} is VALID [2022-04-28 13:57:26,761 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {17491#true} {18056#(< ~counter~0 18)} #63#return; {18056#(< ~counter~0 18)} is VALID [2022-04-28 13:57:26,761 INFO L290 TraceCheckUtils]: 130: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,761 INFO L290 TraceCheckUtils]: 129: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,761 INFO L290 TraceCheckUtils]: 128: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,761 INFO L272 TraceCheckUtils]: 127: Hoare triple {18056#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,762 INFO L290 TraceCheckUtils]: 126: Hoare triple {18056#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {18056#(< ~counter~0 18)} is VALID [2022-04-28 13:57:26,762 INFO L290 TraceCheckUtils]: 125: Hoare triple {18084#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18056#(< ~counter~0 18)} is VALID [2022-04-28 13:57:26,763 INFO L290 TraceCheckUtils]: 124: Hoare triple {18084#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {18084#(< ~counter~0 17)} is VALID [2022-04-28 13:57:26,767 INFO L290 TraceCheckUtils]: 123: Hoare triple {18084#(< ~counter~0 17)} assume !!(0 != ~y3~0); {18084#(< ~counter~0 17)} is VALID [2022-04-28 13:57:26,768 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17491#true} {18084#(< ~counter~0 17)} #63#return; {18084#(< ~counter~0 17)} is VALID [2022-04-28 13:57:26,768 INFO L290 TraceCheckUtils]: 121: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,768 INFO L290 TraceCheckUtils]: 120: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,768 INFO L290 TraceCheckUtils]: 119: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,768 INFO L272 TraceCheckUtils]: 118: Hoare triple {18084#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,768 INFO L290 TraceCheckUtils]: 117: Hoare triple {18084#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {18084#(< ~counter~0 17)} is VALID [2022-04-28 13:57:26,769 INFO L290 TraceCheckUtils]: 116: Hoare triple {17940#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18084#(< ~counter~0 17)} is VALID [2022-04-28 13:57:26,769 INFO L290 TraceCheckUtils]: 115: Hoare triple {17940#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:26,769 INFO L290 TraceCheckUtils]: 114: Hoare triple {17940#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:26,770 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17491#true} {17940#(<= ~counter~0 15)} #63#return; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:26,770 INFO L290 TraceCheckUtils]: 112: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,770 INFO L290 TraceCheckUtils]: 111: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,770 INFO L290 TraceCheckUtils]: 110: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,770 INFO L272 TraceCheckUtils]: 109: Hoare triple {17940#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,770 INFO L290 TraceCheckUtils]: 108: Hoare triple {17940#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:26,771 INFO L290 TraceCheckUtils]: 107: Hoare triple {17912#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17940#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:26,771 INFO L290 TraceCheckUtils]: 106: Hoare triple {17912#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:26,771 INFO L290 TraceCheckUtils]: 105: Hoare triple {17912#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:26,772 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17491#true} {17912#(<= ~counter~0 14)} #63#return; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:26,772 INFO L290 TraceCheckUtils]: 103: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,772 INFO L290 TraceCheckUtils]: 102: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,772 INFO L290 TraceCheckUtils]: 101: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,772 INFO L272 TraceCheckUtils]: 100: Hoare triple {17912#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,772 INFO L290 TraceCheckUtils]: 99: Hoare triple {17912#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:26,773 INFO L290 TraceCheckUtils]: 98: Hoare triple {17884#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17912#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:26,773 INFO L290 TraceCheckUtils]: 97: Hoare triple {17884#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:26,773 INFO L290 TraceCheckUtils]: 96: Hoare triple {17884#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:26,774 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17491#true} {17884#(<= ~counter~0 13)} #63#return; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:26,774 INFO L290 TraceCheckUtils]: 94: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,774 INFO L290 TraceCheckUtils]: 93: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,774 INFO L290 TraceCheckUtils]: 92: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,774 INFO L272 TraceCheckUtils]: 91: Hoare triple {17884#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,774 INFO L290 TraceCheckUtils]: 90: Hoare triple {17884#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:26,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {17856#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17884#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:26,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {17856#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:26,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {17856#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:26,776 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17491#true} {17856#(<= ~counter~0 12)} #63#return; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:26,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,776 INFO L272 TraceCheckUtils]: 82: Hoare triple {17856#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {17856#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:26,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {17828#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17856#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:26,777 INFO L290 TraceCheckUtils]: 79: Hoare triple {17828#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:26,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {17828#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:26,778 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17491#true} {17828#(<= ~counter~0 11)} #63#return; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:26,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,778 INFO L272 TraceCheckUtils]: 73: Hoare triple {17828#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {17828#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:26,779 INFO L290 TraceCheckUtils]: 71: Hoare triple {17800#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17828#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:26,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {17800#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:26,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {17800#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:26,780 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17491#true} {17800#(<= ~counter~0 10)} #63#return; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:26,780 INFO L290 TraceCheckUtils]: 67: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,780 INFO L272 TraceCheckUtils]: 64: Hoare triple {17800#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {17800#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:26,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {17772#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17800#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:26,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {17772#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:26,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {17772#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:26,782 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17491#true} {17772#(<= ~counter~0 9)} #63#return; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:26,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,782 INFO L272 TraceCheckUtils]: 55: Hoare triple {17772#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {17772#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:26,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {17744#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17772#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:26,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {17744#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:26,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {17744#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:26,784 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17491#true} {17744#(<= ~counter~0 8)} #63#return; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:26,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,784 INFO L272 TraceCheckUtils]: 46: Hoare triple {17744#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {17744#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:26,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {17716#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17744#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:26,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {17716#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:26,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {17716#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:26,786 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17491#true} {17716#(<= ~counter~0 7)} #63#return; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:26,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,786 INFO L272 TraceCheckUtils]: 37: Hoare triple {17716#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {17716#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:26,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {17688#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17716#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:26,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {17688#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:26,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {17688#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:26,788 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17491#true} {17688#(<= ~counter~0 6)} #63#return; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:26,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,788 INFO L272 TraceCheckUtils]: 28: Hoare triple {17688#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {17688#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:26,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {17660#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17688#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:26,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {17660#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:26,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {17660#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:26,790 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17491#true} {17660#(<= ~counter~0 5)} #63#return; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:26,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,790 INFO L272 TraceCheckUtils]: 19: Hoare triple {17660#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {17660#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:26,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {17632#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17660#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:26,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {17632#(<= ~counter~0 4)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,791 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17491#true} {17632#(<= ~counter~0 4)} #61#return; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L272 TraceCheckUtils]: 11: Hoare triple {17632#(<= ~counter~0 4)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17491#true} {17632#(<= ~counter~0 4)} #59#return; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {17491#true} assume !(0 == ~cond); {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {17491#true} ~cond := #in~cond; {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {17632#(<= ~counter~0 4)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {17491#true} is VALID [2022-04-28 13:57:26,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {17632#(<= ~counter~0 4)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {17632#(<= ~counter~0 4)} call #t~ret7 := main(); {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17632#(<= ~counter~0 4)} {17491#true} #67#return; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {17632#(<= ~counter~0 4)} assume true; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17632#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:26,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17491#true} is VALID [2022-04-28 13:57:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 30 proven. 555 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 13:57:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323344890] [2022-04-28 13:57:26,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361631505] [2022-04-28 13:57:26,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361631505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:26,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:26,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-28 13:57:26,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826002588] [2022-04-28 13:57:26,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826002588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:26,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:26,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 13:57:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210844807] [2022-04-28 13:57:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 158 [2022-04-28 13:57:26,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:26,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 13:57:26,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:26,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 13:57:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 13:57:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:26,924 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 13:57:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:27,634 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2022-04-28 13:57:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 13:57:27,634 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 158 [2022-04-28 13:57:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 13:57:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 185 transitions. [2022-04-28 13:57:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 13:57:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 185 transitions. [2022-04-28 13:57:27,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 185 transitions. [2022-04-28 13:57:27,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:27,778 INFO L225 Difference]: With dead ends: 169 [2022-04-28 13:57:27,778 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 13:57:27,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=581, Invalid=901, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 13:57:27,779 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:27,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 208 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 13:57:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-28 13:57:27,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:27,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:57:27,966 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:57:27,966 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:57:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:27,969 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2022-04-28 13:57:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-28 13:57:27,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:27,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:27,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 164 states. [2022-04-28 13:57:27,970 INFO L87 Difference]: Start difference. First operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 164 states. [2022-04-28 13:57:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:27,972 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2022-04-28 13:57:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-28 13:57:27,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:27,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:27,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:27,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 13:57:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 181 transitions. [2022-04-28 13:57:27,976 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 181 transitions. Word has length 158 [2022-04-28 13:57:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:27,977 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 181 transitions. [2022-04-28 13:57:27,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 13:57:27,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 181 transitions. [2022-04-28 13:57:28,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-28 13:57:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 13:57:28,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:28,196 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:28,221 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 13:57:28,396 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 13:57:28,396 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1479991018, now seen corresponding path program 31 times [2022-04-28 13:57:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:28,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415033419] [2022-04-28 13:57:28,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1479991018, now seen corresponding path program 32 times [2022-04-28 13:57:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:28,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521169027] [2022-04-28 13:57:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:28,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:28,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340314755] [2022-04-28 13:57:28,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:28,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:28,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:28,418 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 13:57:28,452 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 13:57:28,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:28,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:28,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 13:57:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:28,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:29,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {19486#true} call ULTIMATE.init(); {19486#true} is VALID [2022-04-28 13:57:29,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {19486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {19494#(<= ~counter~0 0)} assume true; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19494#(<= ~counter~0 0)} {19486#true} #67#return; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {19494#(<= ~counter~0 0)} call #t~ret7 := main(); {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {19494#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {19494#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {19494#(<= ~counter~0 0)} ~cond := #in~cond; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {19494#(<= ~counter~0 0)} assume !(0 == ~cond); {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {19494#(<= ~counter~0 0)} assume true; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19494#(<= ~counter~0 0)} {19494#(<= ~counter~0 0)} #59#return; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {19494#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {19494#(<= ~counter~0 0)} ~cond := #in~cond; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {19494#(<= ~counter~0 0)} assume !(0 == ~cond); {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {19494#(<= ~counter~0 0)} assume true; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,411 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19494#(<= ~counter~0 0)} {19494#(<= ~counter~0 0)} #61#return; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {19494#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {19494#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:29,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {19494#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {19543#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,413 INFO L272 TraceCheckUtils]: 19: Hoare triple {19543#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {19543#(<= ~counter~0 1)} ~cond := #in~cond; {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {19543#(<= ~counter~0 1)} assume !(0 == ~cond); {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {19543#(<= ~counter~0 1)} assume true; {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,414 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19543#(<= ~counter~0 1)} {19543#(<= ~counter~0 1)} #63#return; {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {19543#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {19543#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19543#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:29,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {19543#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {19571#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,416 INFO L272 TraceCheckUtils]: 28: Hoare triple {19571#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {19571#(<= ~counter~0 2)} ~cond := #in~cond; {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {19571#(<= ~counter~0 2)} assume !(0 == ~cond); {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {19571#(<= ~counter~0 2)} assume true; {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,417 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19571#(<= ~counter~0 2)} {19571#(<= ~counter~0 2)} #63#return; {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {19571#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {19571#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19571#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:29,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {19571#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {19599#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,419 INFO L272 TraceCheckUtils]: 37: Hoare triple {19599#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {19599#(<= ~counter~0 3)} ~cond := #in~cond; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {19599#(<= ~counter~0 3)} assume !(0 == ~cond); {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {19599#(<= ~counter~0 3)} assume true; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,420 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19599#(<= ~counter~0 3)} {19599#(<= ~counter~0 3)} #63#return; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {19599#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {19599#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:29,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {19599#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {19627#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,422 INFO L272 TraceCheckUtils]: 46: Hoare triple {19627#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {19627#(<= ~counter~0 4)} ~cond := #in~cond; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {19627#(<= ~counter~0 4)} assume !(0 == ~cond); {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {19627#(<= ~counter~0 4)} assume true; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,423 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19627#(<= ~counter~0 4)} {19627#(<= ~counter~0 4)} #63#return; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {19627#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {19627#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:29,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {19627#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {19655#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,425 INFO L272 TraceCheckUtils]: 55: Hoare triple {19655#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {19655#(<= ~counter~0 5)} ~cond := #in~cond; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,426 INFO L290 TraceCheckUtils]: 57: Hoare triple {19655#(<= ~counter~0 5)} assume !(0 == ~cond); {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,426 INFO L290 TraceCheckUtils]: 58: Hoare triple {19655#(<= ~counter~0 5)} assume true; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,426 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19655#(<= ~counter~0 5)} {19655#(<= ~counter~0 5)} #63#return; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {19655#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,427 INFO L290 TraceCheckUtils]: 61: Hoare triple {19655#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:29,427 INFO L290 TraceCheckUtils]: 62: Hoare triple {19655#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,428 INFO L290 TraceCheckUtils]: 63: Hoare triple {19683#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,428 INFO L272 TraceCheckUtils]: 64: Hoare triple {19683#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {19683#(<= ~counter~0 6)} ~cond := #in~cond; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {19683#(<= ~counter~0 6)} assume !(0 == ~cond); {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {19683#(<= ~counter~0 6)} assume true; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,430 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19683#(<= ~counter~0 6)} {19683#(<= ~counter~0 6)} #63#return; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {19683#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {19683#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:29,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {19683#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {19711#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,431 INFO L272 TraceCheckUtils]: 73: Hoare triple {19711#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {19711#(<= ~counter~0 7)} ~cond := #in~cond; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {19711#(<= ~counter~0 7)} assume !(0 == ~cond); {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {19711#(<= ~counter~0 7)} assume true; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,433 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19711#(<= ~counter~0 7)} {19711#(<= ~counter~0 7)} #63#return; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,433 INFO L290 TraceCheckUtils]: 78: Hoare triple {19711#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,433 INFO L290 TraceCheckUtils]: 79: Hoare triple {19711#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:29,434 INFO L290 TraceCheckUtils]: 80: Hoare triple {19711#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,434 INFO L290 TraceCheckUtils]: 81: Hoare triple {19739#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,434 INFO L272 TraceCheckUtils]: 82: Hoare triple {19739#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,435 INFO L290 TraceCheckUtils]: 83: Hoare triple {19739#(<= ~counter~0 8)} ~cond := #in~cond; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,435 INFO L290 TraceCheckUtils]: 84: Hoare triple {19739#(<= ~counter~0 8)} assume !(0 == ~cond); {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,435 INFO L290 TraceCheckUtils]: 85: Hoare triple {19739#(<= ~counter~0 8)} assume true; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,436 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19739#(<= ~counter~0 8)} {19739#(<= ~counter~0 8)} #63#return; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,436 INFO L290 TraceCheckUtils]: 87: Hoare triple {19739#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,436 INFO L290 TraceCheckUtils]: 88: Hoare triple {19739#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:29,437 INFO L290 TraceCheckUtils]: 89: Hoare triple {19739#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,437 INFO L290 TraceCheckUtils]: 90: Hoare triple {19767#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,438 INFO L272 TraceCheckUtils]: 91: Hoare triple {19767#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,438 INFO L290 TraceCheckUtils]: 92: Hoare triple {19767#(<= ~counter~0 9)} ~cond := #in~cond; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,438 INFO L290 TraceCheckUtils]: 93: Hoare triple {19767#(<= ~counter~0 9)} assume !(0 == ~cond); {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,438 INFO L290 TraceCheckUtils]: 94: Hoare triple {19767#(<= ~counter~0 9)} assume true; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,439 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19767#(<= ~counter~0 9)} {19767#(<= ~counter~0 9)} #63#return; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,439 INFO L290 TraceCheckUtils]: 96: Hoare triple {19767#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,439 INFO L290 TraceCheckUtils]: 97: Hoare triple {19767#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:29,440 INFO L290 TraceCheckUtils]: 98: Hoare triple {19767#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,440 INFO L290 TraceCheckUtils]: 99: Hoare triple {19795#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,441 INFO L272 TraceCheckUtils]: 100: Hoare triple {19795#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,441 INFO L290 TraceCheckUtils]: 101: Hoare triple {19795#(<= ~counter~0 10)} ~cond := #in~cond; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,441 INFO L290 TraceCheckUtils]: 102: Hoare triple {19795#(<= ~counter~0 10)} assume !(0 == ~cond); {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,442 INFO L290 TraceCheckUtils]: 103: Hoare triple {19795#(<= ~counter~0 10)} assume true; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,442 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19795#(<= ~counter~0 10)} {19795#(<= ~counter~0 10)} #63#return; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,442 INFO L290 TraceCheckUtils]: 105: Hoare triple {19795#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,443 INFO L290 TraceCheckUtils]: 106: Hoare triple {19795#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:29,443 INFO L290 TraceCheckUtils]: 107: Hoare triple {19795#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,443 INFO L290 TraceCheckUtils]: 108: Hoare triple {19823#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,444 INFO L272 TraceCheckUtils]: 109: Hoare triple {19823#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,444 INFO L290 TraceCheckUtils]: 110: Hoare triple {19823#(<= ~counter~0 11)} ~cond := #in~cond; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,444 INFO L290 TraceCheckUtils]: 111: Hoare triple {19823#(<= ~counter~0 11)} assume !(0 == ~cond); {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,445 INFO L290 TraceCheckUtils]: 112: Hoare triple {19823#(<= ~counter~0 11)} assume true; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,445 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19823#(<= ~counter~0 11)} {19823#(<= ~counter~0 11)} #63#return; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,445 INFO L290 TraceCheckUtils]: 114: Hoare triple {19823#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,446 INFO L290 TraceCheckUtils]: 115: Hoare triple {19823#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:29,446 INFO L290 TraceCheckUtils]: 116: Hoare triple {19823#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,446 INFO L290 TraceCheckUtils]: 117: Hoare triple {19851#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,447 INFO L272 TraceCheckUtils]: 118: Hoare triple {19851#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,447 INFO L290 TraceCheckUtils]: 119: Hoare triple {19851#(<= ~counter~0 12)} ~cond := #in~cond; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,448 INFO L290 TraceCheckUtils]: 120: Hoare triple {19851#(<= ~counter~0 12)} assume !(0 == ~cond); {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,448 INFO L290 TraceCheckUtils]: 121: Hoare triple {19851#(<= ~counter~0 12)} assume true; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,448 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19851#(<= ~counter~0 12)} {19851#(<= ~counter~0 12)} #63#return; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,449 INFO L290 TraceCheckUtils]: 123: Hoare triple {19851#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,449 INFO L290 TraceCheckUtils]: 124: Hoare triple {19851#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:29,449 INFO L290 TraceCheckUtils]: 125: Hoare triple {19851#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,450 INFO L290 TraceCheckUtils]: 126: Hoare triple {19879#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,450 INFO L272 TraceCheckUtils]: 127: Hoare triple {19879#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,450 INFO L290 TraceCheckUtils]: 128: Hoare triple {19879#(<= ~counter~0 13)} ~cond := #in~cond; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,451 INFO L290 TraceCheckUtils]: 129: Hoare triple {19879#(<= ~counter~0 13)} assume !(0 == ~cond); {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,451 INFO L290 TraceCheckUtils]: 130: Hoare triple {19879#(<= ~counter~0 13)} assume true; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,452 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {19879#(<= ~counter~0 13)} {19879#(<= ~counter~0 13)} #63#return; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,452 INFO L290 TraceCheckUtils]: 132: Hoare triple {19879#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,452 INFO L290 TraceCheckUtils]: 133: Hoare triple {19879#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:29,452 INFO L290 TraceCheckUtils]: 134: Hoare triple {19879#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,453 INFO L290 TraceCheckUtils]: 135: Hoare triple {19907#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,453 INFO L272 TraceCheckUtils]: 136: Hoare triple {19907#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,454 INFO L290 TraceCheckUtils]: 137: Hoare triple {19907#(<= ~counter~0 14)} ~cond := #in~cond; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,454 INFO L290 TraceCheckUtils]: 138: Hoare triple {19907#(<= ~counter~0 14)} assume !(0 == ~cond); {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,454 INFO L290 TraceCheckUtils]: 139: Hoare triple {19907#(<= ~counter~0 14)} assume true; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,455 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {19907#(<= ~counter~0 14)} {19907#(<= ~counter~0 14)} #63#return; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,455 INFO L290 TraceCheckUtils]: 141: Hoare triple {19907#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,455 INFO L290 TraceCheckUtils]: 142: Hoare triple {19907#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:29,456 INFO L290 TraceCheckUtils]: 143: Hoare triple {19907#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,456 INFO L290 TraceCheckUtils]: 144: Hoare triple {19935#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,456 INFO L272 TraceCheckUtils]: 145: Hoare triple {19935#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,457 INFO L290 TraceCheckUtils]: 146: Hoare triple {19935#(<= ~counter~0 15)} ~cond := #in~cond; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,457 INFO L290 TraceCheckUtils]: 147: Hoare triple {19935#(<= ~counter~0 15)} assume !(0 == ~cond); {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,457 INFO L290 TraceCheckUtils]: 148: Hoare triple {19935#(<= ~counter~0 15)} assume true; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,458 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {19935#(<= ~counter~0 15)} {19935#(<= ~counter~0 15)} #63#return; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,458 INFO L290 TraceCheckUtils]: 150: Hoare triple {19935#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,458 INFO L290 TraceCheckUtils]: 151: Hoare triple {19935#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:29,459 INFO L290 TraceCheckUtils]: 152: Hoare triple {19935#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,459 INFO L290 TraceCheckUtils]: 153: Hoare triple {19963#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,460 INFO L272 TraceCheckUtils]: 154: Hoare triple {19963#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,460 INFO L290 TraceCheckUtils]: 155: Hoare triple {19963#(<= ~counter~0 16)} ~cond := #in~cond; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,460 INFO L290 TraceCheckUtils]: 156: Hoare triple {19963#(<= ~counter~0 16)} assume !(0 == ~cond); {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,460 INFO L290 TraceCheckUtils]: 157: Hoare triple {19963#(<= ~counter~0 16)} assume true; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,461 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19963#(<= ~counter~0 16)} {19963#(<= ~counter~0 16)} #63#return; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,461 INFO L290 TraceCheckUtils]: 159: Hoare triple {19963#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,461 INFO L290 TraceCheckUtils]: 160: Hoare triple {19963#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:29,462 INFO L290 TraceCheckUtils]: 161: Hoare triple {19963#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19991#(<= |main_#t~post6| 16)} is VALID [2022-04-28 13:57:29,462 INFO L290 TraceCheckUtils]: 162: Hoare triple {19991#(<= |main_#t~post6| 16)} assume !(#t~post6 < 20);havoc #t~post6; {19487#false} is VALID [2022-04-28 13:57:29,462 INFO L272 TraceCheckUtils]: 163: Hoare triple {19487#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {19487#false} is VALID [2022-04-28 13:57:29,462 INFO L290 TraceCheckUtils]: 164: Hoare triple {19487#false} ~cond := #in~cond; {19487#false} is VALID [2022-04-28 13:57:29,462 INFO L290 TraceCheckUtils]: 165: Hoare triple {19487#false} assume 0 == ~cond; {19487#false} is VALID [2022-04-28 13:57:29,462 INFO L290 TraceCheckUtils]: 166: Hoare triple {19487#false} assume !false; {19487#false} is VALID [2022-04-28 13:57:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 32 proven. 1112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:29,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:30,214 INFO L290 TraceCheckUtils]: 166: Hoare triple {19487#false} assume !false; {19487#false} is VALID [2022-04-28 13:57:30,214 INFO L290 TraceCheckUtils]: 165: Hoare triple {19487#false} assume 0 == ~cond; {19487#false} is VALID [2022-04-28 13:57:30,214 INFO L290 TraceCheckUtils]: 164: Hoare triple {19487#false} ~cond := #in~cond; {19487#false} is VALID [2022-04-28 13:57:30,214 INFO L272 TraceCheckUtils]: 163: Hoare triple {19487#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {19487#false} is VALID [2022-04-28 13:57:30,214 INFO L290 TraceCheckUtils]: 162: Hoare triple {20019#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {19487#false} is VALID [2022-04-28 13:57:30,215 INFO L290 TraceCheckUtils]: 161: Hoare triple {20023#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20019#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:30,215 INFO L290 TraceCheckUtils]: 160: Hoare triple {20023#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {20023#(< ~counter~0 20)} is VALID [2022-04-28 13:57:30,215 INFO L290 TraceCheckUtils]: 159: Hoare triple {20023#(< ~counter~0 20)} assume !!(0 != ~y3~0); {20023#(< ~counter~0 20)} is VALID [2022-04-28 13:57:30,216 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19486#true} {20023#(< ~counter~0 20)} #63#return; {20023#(< ~counter~0 20)} is VALID [2022-04-28 13:57:30,216 INFO L290 TraceCheckUtils]: 157: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,216 INFO L290 TraceCheckUtils]: 156: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,216 INFO L290 TraceCheckUtils]: 155: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,216 INFO L272 TraceCheckUtils]: 154: Hoare triple {20023#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,216 INFO L290 TraceCheckUtils]: 153: Hoare triple {20023#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {20023#(< ~counter~0 20)} is VALID [2022-04-28 13:57:30,217 INFO L290 TraceCheckUtils]: 152: Hoare triple {20051#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20023#(< ~counter~0 20)} is VALID [2022-04-28 13:57:30,217 INFO L290 TraceCheckUtils]: 151: Hoare triple {20051#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {20051#(< ~counter~0 19)} is VALID [2022-04-28 13:57:30,217 INFO L290 TraceCheckUtils]: 150: Hoare triple {20051#(< ~counter~0 19)} assume !!(0 != ~y3~0); {20051#(< ~counter~0 19)} is VALID [2022-04-28 13:57:30,218 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {19486#true} {20051#(< ~counter~0 19)} #63#return; {20051#(< ~counter~0 19)} is VALID [2022-04-28 13:57:30,218 INFO L290 TraceCheckUtils]: 148: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,218 INFO L290 TraceCheckUtils]: 147: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,218 INFO L290 TraceCheckUtils]: 146: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,218 INFO L272 TraceCheckUtils]: 145: Hoare triple {20051#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,218 INFO L290 TraceCheckUtils]: 144: Hoare triple {20051#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {20051#(< ~counter~0 19)} is VALID [2022-04-28 13:57:30,219 INFO L290 TraceCheckUtils]: 143: Hoare triple {20079#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20051#(< ~counter~0 19)} is VALID [2022-04-28 13:57:30,219 INFO L290 TraceCheckUtils]: 142: Hoare triple {20079#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {20079#(< ~counter~0 18)} is VALID [2022-04-28 13:57:30,219 INFO L290 TraceCheckUtils]: 141: Hoare triple {20079#(< ~counter~0 18)} assume !!(0 != ~y3~0); {20079#(< ~counter~0 18)} is VALID [2022-04-28 13:57:30,220 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {19486#true} {20079#(< ~counter~0 18)} #63#return; {20079#(< ~counter~0 18)} is VALID [2022-04-28 13:57:30,220 INFO L290 TraceCheckUtils]: 139: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,220 INFO L290 TraceCheckUtils]: 138: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,220 INFO L290 TraceCheckUtils]: 137: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,220 INFO L272 TraceCheckUtils]: 136: Hoare triple {20079#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,222 INFO L290 TraceCheckUtils]: 135: Hoare triple {20079#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {20079#(< ~counter~0 18)} is VALID [2022-04-28 13:57:30,223 INFO L290 TraceCheckUtils]: 134: Hoare triple {19963#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20079#(< ~counter~0 18)} is VALID [2022-04-28 13:57:30,223 INFO L290 TraceCheckUtils]: 133: Hoare triple {19963#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:30,223 INFO L290 TraceCheckUtils]: 132: Hoare triple {19963#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:30,224 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {19486#true} {19963#(<= ~counter~0 16)} #63#return; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:30,224 INFO L290 TraceCheckUtils]: 130: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,224 INFO L290 TraceCheckUtils]: 129: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,224 INFO L290 TraceCheckUtils]: 128: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,224 INFO L272 TraceCheckUtils]: 127: Hoare triple {19963#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,224 INFO L290 TraceCheckUtils]: 126: Hoare triple {19963#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:30,225 INFO L290 TraceCheckUtils]: 125: Hoare triple {19935#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19963#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:30,225 INFO L290 TraceCheckUtils]: 124: Hoare triple {19935#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:30,225 INFO L290 TraceCheckUtils]: 123: Hoare triple {19935#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:30,226 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19486#true} {19935#(<= ~counter~0 15)} #63#return; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:30,226 INFO L290 TraceCheckUtils]: 121: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,226 INFO L290 TraceCheckUtils]: 120: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,226 INFO L290 TraceCheckUtils]: 119: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,226 INFO L272 TraceCheckUtils]: 118: Hoare triple {19935#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,226 INFO L290 TraceCheckUtils]: 117: Hoare triple {19935#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:30,227 INFO L290 TraceCheckUtils]: 116: Hoare triple {19907#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19935#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:30,227 INFO L290 TraceCheckUtils]: 115: Hoare triple {19907#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:30,227 INFO L290 TraceCheckUtils]: 114: Hoare triple {19907#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:30,228 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19486#true} {19907#(<= ~counter~0 14)} #63#return; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:30,228 INFO L290 TraceCheckUtils]: 112: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,228 INFO L290 TraceCheckUtils]: 111: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,228 INFO L290 TraceCheckUtils]: 110: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,228 INFO L272 TraceCheckUtils]: 109: Hoare triple {19907#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,228 INFO L290 TraceCheckUtils]: 108: Hoare triple {19907#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:30,229 INFO L290 TraceCheckUtils]: 107: Hoare triple {19879#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19907#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:30,229 INFO L290 TraceCheckUtils]: 106: Hoare triple {19879#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:30,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {19879#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:30,230 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19486#true} {19879#(<= ~counter~0 13)} #63#return; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:30,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,230 INFO L290 TraceCheckUtils]: 102: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,230 INFO L290 TraceCheckUtils]: 101: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,230 INFO L272 TraceCheckUtils]: 100: Hoare triple {19879#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,230 INFO L290 TraceCheckUtils]: 99: Hoare triple {19879#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:30,231 INFO L290 TraceCheckUtils]: 98: Hoare triple {19851#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19879#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:30,231 INFO L290 TraceCheckUtils]: 97: Hoare triple {19851#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:30,231 INFO L290 TraceCheckUtils]: 96: Hoare triple {19851#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:30,232 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19486#true} {19851#(<= ~counter~0 12)} #63#return; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:30,232 INFO L290 TraceCheckUtils]: 94: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,232 INFO L290 TraceCheckUtils]: 93: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,232 INFO L272 TraceCheckUtils]: 91: Hoare triple {19851#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,232 INFO L290 TraceCheckUtils]: 90: Hoare triple {19851#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:30,233 INFO L290 TraceCheckUtils]: 89: Hoare triple {19823#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19851#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:30,233 INFO L290 TraceCheckUtils]: 88: Hoare triple {19823#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:30,233 INFO L290 TraceCheckUtils]: 87: Hoare triple {19823#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:30,234 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19486#true} {19823#(<= ~counter~0 11)} #63#return; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:30,234 INFO L290 TraceCheckUtils]: 85: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,234 INFO L290 TraceCheckUtils]: 84: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,234 INFO L290 TraceCheckUtils]: 83: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,234 INFO L272 TraceCheckUtils]: 82: Hoare triple {19823#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,234 INFO L290 TraceCheckUtils]: 81: Hoare triple {19823#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:30,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {19795#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19823#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:30,235 INFO L290 TraceCheckUtils]: 79: Hoare triple {19795#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:30,235 INFO L290 TraceCheckUtils]: 78: Hoare triple {19795#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:30,236 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19486#true} {19795#(<= ~counter~0 10)} #63#return; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:30,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,236 INFO L290 TraceCheckUtils]: 75: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,236 INFO L290 TraceCheckUtils]: 74: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,236 INFO L272 TraceCheckUtils]: 73: Hoare triple {19795#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {19795#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:30,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {19767#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19795#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:30,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {19767#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:30,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {19767#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:30,238 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19486#true} {19767#(<= ~counter~0 9)} #63#return; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:30,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,238 INFO L272 TraceCheckUtils]: 64: Hoare triple {19767#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,238 INFO L290 TraceCheckUtils]: 63: Hoare triple {19767#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:30,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {19739#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19767#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:30,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {19739#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:30,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {19739#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:30,240 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19486#true} {19739#(<= ~counter~0 8)} #63#return; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:30,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,240 INFO L290 TraceCheckUtils]: 56: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,240 INFO L272 TraceCheckUtils]: 55: Hoare triple {19739#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {19739#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:30,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {19711#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19739#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:30,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {19711#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:30,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {19711#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:30,247 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19486#true} {19711#(<= ~counter~0 7)} #63#return; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:30,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,248 INFO L272 TraceCheckUtils]: 46: Hoare triple {19711#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {19711#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:30,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {19683#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19711#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:30,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {19683#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:30,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {19683#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:30,250 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19486#true} {19683#(<= ~counter~0 6)} #63#return; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:30,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,251 INFO L272 TraceCheckUtils]: 37: Hoare triple {19683#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {19683#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:30,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {19655#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19683#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:30,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {19655#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:30,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {19655#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:30,253 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19486#true} {19655#(<= ~counter~0 5)} #63#return; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:30,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,254 INFO L272 TraceCheckUtils]: 28: Hoare triple {19655#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {19655#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:30,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {19627#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19655#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:30,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {19627#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:30,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {19627#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:30,256 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19486#true} {19627#(<= ~counter~0 4)} #63#return; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:30,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {19627#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {19627#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:30,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {19599#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19627#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:30,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {19599#(<= ~counter~0 3)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,258 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19486#true} {19599#(<= ~counter~0 3)} #61#return; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {19599#(<= ~counter~0 3)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19486#true} {19599#(<= ~counter~0 3)} #59#return; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {19486#true} assume true; {19486#true} is VALID [2022-04-28 13:57:30,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {19486#true} assume !(0 == ~cond); {19486#true} is VALID [2022-04-28 13:57:30,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {19486#true} ~cond := #in~cond; {19486#true} is VALID [2022-04-28 13:57:30,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {19599#(<= ~counter~0 3)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {19486#true} is VALID [2022-04-28 13:57:30,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {19599#(<= ~counter~0 3)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {19599#(<= ~counter~0 3)} call #t~ret7 := main(); {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19599#(<= ~counter~0 3)} {19486#true} #67#return; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {19599#(<= ~counter~0 3)} assume true; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {19486#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19599#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:30,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {19486#true} call ULTIMATE.init(); {19486#true} is VALID [2022-04-28 13:57:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 32 proven. 632 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 13:57:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521169027] [2022-04-28 13:57:30,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:30,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340314755] [2022-04-28 13:57:30,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340314755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:30,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:30,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-28 13:57:30,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:30,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415033419] [2022-04-28 13:57:30,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415033419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:30,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:30,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 13:57:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944122373] [2022-04-28 13:57:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:30,264 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 167 [2022-04-28 13:57:30,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:30,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 13:57:30,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:30,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 13:57:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 13:57:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:30,407 INFO L87 Difference]: Start difference. First operand 164 states and 181 transitions. Second operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 13:57:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:31,110 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2022-04-28 13:57:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 13:57:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 167 [2022-04-28 13:57:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 13:57:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 195 transitions. [2022-04-28 13:57:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 13:57:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 195 transitions. [2022-04-28 13:57:31,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 195 transitions. [2022-04-28 13:57:31,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:31,286 INFO L225 Difference]: With dead ends: 178 [2022-04-28 13:57:31,286 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 13:57:31,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=604, Invalid=956, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 13:57:31,287 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 75 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:31,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 210 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 13:57:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 13:57:31,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:31,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 13:57:31,517 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 13:57:31,517 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 13:57:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:31,520 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2022-04-28 13:57:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-28 13:57:31,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:31,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:31,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 173 states. [2022-04-28 13:57:31,521 INFO L87 Difference]: Start difference. First operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 173 states. [2022-04-28 13:57:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:31,524 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2022-04-28 13:57:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-28 13:57:31,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:31,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:31,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:31,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 13:57:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2022-04-28 13:57:31,528 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 167 [2022-04-28 13:57:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:31,528 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2022-04-28 13:57:31,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 13:57:31,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 191 transitions. [2022-04-28 13:57:31,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-28 13:57:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-28 13:57:31,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:31,762 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:31,788 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 13:57:31,963 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 13:57:31,963 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:31,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:31,963 INFO L85 PathProgramCache]: Analyzing trace with hash 318093084, now seen corresponding path program 33 times [2022-04-28 13:57:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:31,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233987787] [2022-04-28 13:57:31,964 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 318093084, now seen corresponding path program 34 times [2022-04-28 13:57:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:31,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097531108] [2022-04-28 13:57:31,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:31,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:31,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347418550] [2022-04-28 13:57:31,979 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:31,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:31,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:31,980 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 13:57:31,980 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 13:57:32,066 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:32,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:32,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 13:57:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:32,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:33,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {21591#true} call ULTIMATE.init(); {21591#true} is VALID [2022-04-28 13:57:33,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {21591#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {21599#(<= ~counter~0 0)} assume true; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21599#(<= ~counter~0 0)} {21591#true} #67#return; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {21599#(<= ~counter~0 0)} call #t~ret7 := main(); {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {21599#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {21599#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {21599#(<= ~counter~0 0)} ~cond := #in~cond; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {21599#(<= ~counter~0 0)} assume !(0 == ~cond); {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {21599#(<= ~counter~0 0)} assume true; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21599#(<= ~counter~0 0)} {21599#(<= ~counter~0 0)} #59#return; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,081 INFO L272 TraceCheckUtils]: 11: Hoare triple {21599#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {21599#(<= ~counter~0 0)} ~cond := #in~cond; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {21599#(<= ~counter~0 0)} assume !(0 == ~cond); {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {21599#(<= ~counter~0 0)} assume true; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21599#(<= ~counter~0 0)} {21599#(<= ~counter~0 0)} #61#return; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {21599#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {21599#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:33,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {21599#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {21648#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,084 INFO L272 TraceCheckUtils]: 19: Hoare triple {21648#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {21648#(<= ~counter~0 1)} ~cond := #in~cond; {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {21648#(<= ~counter~0 1)} assume !(0 == ~cond); {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {21648#(<= ~counter~0 1)} assume true; {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,086 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21648#(<= ~counter~0 1)} {21648#(<= ~counter~0 1)} #63#return; {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {21648#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {21648#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21648#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:33,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {21648#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {21676#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,088 INFO L272 TraceCheckUtils]: 28: Hoare triple {21676#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {21676#(<= ~counter~0 2)} ~cond := #in~cond; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {21676#(<= ~counter~0 2)} assume !(0 == ~cond); {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {21676#(<= ~counter~0 2)} assume true; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,089 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21676#(<= ~counter~0 2)} {21676#(<= ~counter~0 2)} #63#return; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {21676#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {21676#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {21676#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {21704#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,091 INFO L272 TraceCheckUtils]: 37: Hoare triple {21704#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {21704#(<= ~counter~0 3)} ~cond := #in~cond; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {21704#(<= ~counter~0 3)} assume !(0 == ~cond); {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {21704#(<= ~counter~0 3)} assume true; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,092 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21704#(<= ~counter~0 3)} {21704#(<= ~counter~0 3)} #63#return; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {21704#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {21704#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {21704#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {21732#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,096 INFO L272 TraceCheckUtils]: 46: Hoare triple {21732#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {21732#(<= ~counter~0 4)} ~cond := #in~cond; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {21732#(<= ~counter~0 4)} assume !(0 == ~cond); {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {21732#(<= ~counter~0 4)} assume true; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,097 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21732#(<= ~counter~0 4)} {21732#(<= ~counter~0 4)} #63#return; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {21732#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {21732#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,098 INFO L290 TraceCheckUtils]: 53: Hoare triple {21732#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {21760#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,099 INFO L272 TraceCheckUtils]: 55: Hoare triple {21760#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {21760#(<= ~counter~0 5)} ~cond := #in~cond; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {21760#(<= ~counter~0 5)} assume !(0 == ~cond); {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {21760#(<= ~counter~0 5)} assume true; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,101 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21760#(<= ~counter~0 5)} {21760#(<= ~counter~0 5)} #63#return; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {21760#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {21760#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {21760#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,102 INFO L290 TraceCheckUtils]: 63: Hoare triple {21788#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,103 INFO L272 TraceCheckUtils]: 64: Hoare triple {21788#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {21788#(<= ~counter~0 6)} ~cond := #in~cond; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {21788#(<= ~counter~0 6)} assume !(0 == ~cond); {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {21788#(<= ~counter~0 6)} assume true; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,104 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21788#(<= ~counter~0 6)} {21788#(<= ~counter~0 6)} #63#return; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,104 INFO L290 TraceCheckUtils]: 69: Hoare triple {21788#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {21788#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,105 INFO L290 TraceCheckUtils]: 71: Hoare triple {21788#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {21816#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,106 INFO L272 TraceCheckUtils]: 73: Hoare triple {21816#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {21816#(<= ~counter~0 7)} ~cond := #in~cond; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {21816#(<= ~counter~0 7)} assume !(0 == ~cond); {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {21816#(<= ~counter~0 7)} assume true; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,107 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21816#(<= ~counter~0 7)} {21816#(<= ~counter~0 7)} #63#return; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {21816#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {21816#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {21816#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {21844#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,109 INFO L272 TraceCheckUtils]: 82: Hoare triple {21844#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {21844#(<= ~counter~0 8)} ~cond := #in~cond; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {21844#(<= ~counter~0 8)} assume !(0 == ~cond); {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {21844#(<= ~counter~0 8)} assume true; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,111 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21844#(<= ~counter~0 8)} {21844#(<= ~counter~0 8)} #63#return; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,111 INFO L290 TraceCheckUtils]: 87: Hoare triple {21844#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,111 INFO L290 TraceCheckUtils]: 88: Hoare triple {21844#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,112 INFO L290 TraceCheckUtils]: 89: Hoare triple {21844#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,112 INFO L290 TraceCheckUtils]: 90: Hoare triple {21872#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,112 INFO L272 TraceCheckUtils]: 91: Hoare triple {21872#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,113 INFO L290 TraceCheckUtils]: 92: Hoare triple {21872#(<= ~counter~0 9)} ~cond := #in~cond; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,113 INFO L290 TraceCheckUtils]: 93: Hoare triple {21872#(<= ~counter~0 9)} assume !(0 == ~cond); {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,113 INFO L290 TraceCheckUtils]: 94: Hoare triple {21872#(<= ~counter~0 9)} assume true; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,114 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21872#(<= ~counter~0 9)} {21872#(<= ~counter~0 9)} #63#return; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {21872#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {21872#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {21872#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,115 INFO L290 TraceCheckUtils]: 99: Hoare triple {21900#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,115 INFO L272 TraceCheckUtils]: 100: Hoare triple {21900#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,116 INFO L290 TraceCheckUtils]: 101: Hoare triple {21900#(<= ~counter~0 10)} ~cond := #in~cond; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,116 INFO L290 TraceCheckUtils]: 102: Hoare triple {21900#(<= ~counter~0 10)} assume !(0 == ~cond); {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,116 INFO L290 TraceCheckUtils]: 103: Hoare triple {21900#(<= ~counter~0 10)} assume true; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,117 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21900#(<= ~counter~0 10)} {21900#(<= ~counter~0 10)} #63#return; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,117 INFO L290 TraceCheckUtils]: 105: Hoare triple {21900#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,117 INFO L290 TraceCheckUtils]: 106: Hoare triple {21900#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,118 INFO L290 TraceCheckUtils]: 107: Hoare triple {21900#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {21928#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,119 INFO L272 TraceCheckUtils]: 109: Hoare triple {21928#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,119 INFO L290 TraceCheckUtils]: 110: Hoare triple {21928#(<= ~counter~0 11)} ~cond := #in~cond; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,119 INFO L290 TraceCheckUtils]: 111: Hoare triple {21928#(<= ~counter~0 11)} assume !(0 == ~cond); {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,119 INFO L290 TraceCheckUtils]: 112: Hoare triple {21928#(<= ~counter~0 11)} assume true; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,120 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21928#(<= ~counter~0 11)} {21928#(<= ~counter~0 11)} #63#return; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,120 INFO L290 TraceCheckUtils]: 114: Hoare triple {21928#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,120 INFO L290 TraceCheckUtils]: 115: Hoare triple {21928#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,121 INFO L290 TraceCheckUtils]: 116: Hoare triple {21928#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,121 INFO L290 TraceCheckUtils]: 117: Hoare triple {21956#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,122 INFO L272 TraceCheckUtils]: 118: Hoare triple {21956#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,122 INFO L290 TraceCheckUtils]: 119: Hoare triple {21956#(<= ~counter~0 12)} ~cond := #in~cond; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,122 INFO L290 TraceCheckUtils]: 120: Hoare triple {21956#(<= ~counter~0 12)} assume !(0 == ~cond); {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,123 INFO L290 TraceCheckUtils]: 121: Hoare triple {21956#(<= ~counter~0 12)} assume true; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,123 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21956#(<= ~counter~0 12)} {21956#(<= ~counter~0 12)} #63#return; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,123 INFO L290 TraceCheckUtils]: 123: Hoare triple {21956#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,124 INFO L290 TraceCheckUtils]: 124: Hoare triple {21956#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,124 INFO L290 TraceCheckUtils]: 125: Hoare triple {21956#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,124 INFO L290 TraceCheckUtils]: 126: Hoare triple {21984#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,125 INFO L272 TraceCheckUtils]: 127: Hoare triple {21984#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,125 INFO L290 TraceCheckUtils]: 128: Hoare triple {21984#(<= ~counter~0 13)} ~cond := #in~cond; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,125 INFO L290 TraceCheckUtils]: 129: Hoare triple {21984#(<= ~counter~0 13)} assume !(0 == ~cond); {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,126 INFO L290 TraceCheckUtils]: 130: Hoare triple {21984#(<= ~counter~0 13)} assume true; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,126 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {21984#(<= ~counter~0 13)} {21984#(<= ~counter~0 13)} #63#return; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,126 INFO L290 TraceCheckUtils]: 132: Hoare triple {21984#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,127 INFO L290 TraceCheckUtils]: 133: Hoare triple {21984#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,127 INFO L290 TraceCheckUtils]: 134: Hoare triple {21984#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,127 INFO L290 TraceCheckUtils]: 135: Hoare triple {22012#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,128 INFO L272 TraceCheckUtils]: 136: Hoare triple {22012#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,128 INFO L290 TraceCheckUtils]: 137: Hoare triple {22012#(<= ~counter~0 14)} ~cond := #in~cond; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,128 INFO L290 TraceCheckUtils]: 138: Hoare triple {22012#(<= ~counter~0 14)} assume !(0 == ~cond); {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,129 INFO L290 TraceCheckUtils]: 139: Hoare triple {22012#(<= ~counter~0 14)} assume true; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,129 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {22012#(<= ~counter~0 14)} {22012#(<= ~counter~0 14)} #63#return; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,129 INFO L290 TraceCheckUtils]: 141: Hoare triple {22012#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,130 INFO L290 TraceCheckUtils]: 142: Hoare triple {22012#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,130 INFO L290 TraceCheckUtils]: 143: Hoare triple {22012#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,130 INFO L290 TraceCheckUtils]: 144: Hoare triple {22040#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,131 INFO L272 TraceCheckUtils]: 145: Hoare triple {22040#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,131 INFO L290 TraceCheckUtils]: 146: Hoare triple {22040#(<= ~counter~0 15)} ~cond := #in~cond; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,132 INFO L290 TraceCheckUtils]: 147: Hoare triple {22040#(<= ~counter~0 15)} assume !(0 == ~cond); {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,132 INFO L290 TraceCheckUtils]: 148: Hoare triple {22040#(<= ~counter~0 15)} assume true; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,132 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {22040#(<= ~counter~0 15)} {22040#(<= ~counter~0 15)} #63#return; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,133 INFO L290 TraceCheckUtils]: 150: Hoare triple {22040#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,133 INFO L290 TraceCheckUtils]: 151: Hoare triple {22040#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,133 INFO L290 TraceCheckUtils]: 152: Hoare triple {22040#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,134 INFO L290 TraceCheckUtils]: 153: Hoare triple {22068#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,134 INFO L272 TraceCheckUtils]: 154: Hoare triple {22068#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,134 INFO L290 TraceCheckUtils]: 155: Hoare triple {22068#(<= ~counter~0 16)} ~cond := #in~cond; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,135 INFO L290 TraceCheckUtils]: 156: Hoare triple {22068#(<= ~counter~0 16)} assume !(0 == ~cond); {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,135 INFO L290 TraceCheckUtils]: 157: Hoare triple {22068#(<= ~counter~0 16)} assume true; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,135 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {22068#(<= ~counter~0 16)} {22068#(<= ~counter~0 16)} #63#return; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,136 INFO L290 TraceCheckUtils]: 159: Hoare triple {22068#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,136 INFO L290 TraceCheckUtils]: 160: Hoare triple {22068#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,136 INFO L290 TraceCheckUtils]: 161: Hoare triple {22068#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,137 INFO L290 TraceCheckUtils]: 162: Hoare triple {22096#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,137 INFO L272 TraceCheckUtils]: 163: Hoare triple {22096#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,138 INFO L290 TraceCheckUtils]: 164: Hoare triple {22096#(<= ~counter~0 17)} ~cond := #in~cond; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,152 INFO L290 TraceCheckUtils]: 165: Hoare triple {22096#(<= ~counter~0 17)} assume !(0 == ~cond); {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,153 INFO L290 TraceCheckUtils]: 166: Hoare triple {22096#(<= ~counter~0 17)} assume true; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,153 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {22096#(<= ~counter~0 17)} {22096#(<= ~counter~0 17)} #63#return; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,154 INFO L290 TraceCheckUtils]: 168: Hoare triple {22096#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,154 INFO L290 TraceCheckUtils]: 169: Hoare triple {22096#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,154 INFO L290 TraceCheckUtils]: 170: Hoare triple {22096#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22124#(<= |main_#t~post6| 17)} is VALID [2022-04-28 13:57:33,154 INFO L290 TraceCheckUtils]: 171: Hoare triple {22124#(<= |main_#t~post6| 17)} assume !(#t~post6 < 20);havoc #t~post6; {21592#false} is VALID [2022-04-28 13:57:33,155 INFO L272 TraceCheckUtils]: 172: Hoare triple {21592#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {21592#false} is VALID [2022-04-28 13:57:33,155 INFO L290 TraceCheckUtils]: 173: Hoare triple {21592#false} ~cond := #in~cond; {21592#false} is VALID [2022-04-28 13:57:33,155 INFO L290 TraceCheckUtils]: 174: Hoare triple {21592#false} assume 0 == ~cond; {21592#false} is VALID [2022-04-28 13:57:33,155 INFO L290 TraceCheckUtils]: 175: Hoare triple {21592#false} assume !false; {21592#false} is VALID [2022-04-28 13:57:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 34 proven. 1258 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:33,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:33,914 INFO L290 TraceCheckUtils]: 175: Hoare triple {21592#false} assume !false; {21592#false} is VALID [2022-04-28 13:57:33,915 INFO L290 TraceCheckUtils]: 174: Hoare triple {21592#false} assume 0 == ~cond; {21592#false} is VALID [2022-04-28 13:57:33,915 INFO L290 TraceCheckUtils]: 173: Hoare triple {21592#false} ~cond := #in~cond; {21592#false} is VALID [2022-04-28 13:57:33,915 INFO L272 TraceCheckUtils]: 172: Hoare triple {21592#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {21592#false} is VALID [2022-04-28 13:57:33,915 INFO L290 TraceCheckUtils]: 171: Hoare triple {22152#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {21592#false} is VALID [2022-04-28 13:57:33,915 INFO L290 TraceCheckUtils]: 170: Hoare triple {22156#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22152#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:33,916 INFO L290 TraceCheckUtils]: 169: Hoare triple {22156#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22156#(< ~counter~0 20)} is VALID [2022-04-28 13:57:33,916 INFO L290 TraceCheckUtils]: 168: Hoare triple {22156#(< ~counter~0 20)} assume !!(0 != ~y3~0); {22156#(< ~counter~0 20)} is VALID [2022-04-28 13:57:33,916 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {21591#true} {22156#(< ~counter~0 20)} #63#return; {22156#(< ~counter~0 20)} is VALID [2022-04-28 13:57:33,916 INFO L290 TraceCheckUtils]: 166: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,916 INFO L290 TraceCheckUtils]: 165: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,917 INFO L290 TraceCheckUtils]: 164: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,917 INFO L272 TraceCheckUtils]: 163: Hoare triple {22156#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,917 INFO L290 TraceCheckUtils]: 162: Hoare triple {22156#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {22156#(< ~counter~0 20)} is VALID [2022-04-28 13:57:33,918 INFO L290 TraceCheckUtils]: 161: Hoare triple {22184#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22156#(< ~counter~0 20)} is VALID [2022-04-28 13:57:33,918 INFO L290 TraceCheckUtils]: 160: Hoare triple {22184#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22184#(< ~counter~0 19)} is VALID [2022-04-28 13:57:33,918 INFO L290 TraceCheckUtils]: 159: Hoare triple {22184#(< ~counter~0 19)} assume !!(0 != ~y3~0); {22184#(< ~counter~0 19)} is VALID [2022-04-28 13:57:33,919 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {21591#true} {22184#(< ~counter~0 19)} #63#return; {22184#(< ~counter~0 19)} is VALID [2022-04-28 13:57:33,919 INFO L290 TraceCheckUtils]: 157: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,919 INFO L290 TraceCheckUtils]: 156: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,919 INFO L290 TraceCheckUtils]: 155: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,919 INFO L272 TraceCheckUtils]: 154: Hoare triple {22184#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,919 INFO L290 TraceCheckUtils]: 153: Hoare triple {22184#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {22184#(< ~counter~0 19)} is VALID [2022-04-28 13:57:33,920 INFO L290 TraceCheckUtils]: 152: Hoare triple {22096#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22184#(< ~counter~0 19)} is VALID [2022-04-28 13:57:33,920 INFO L290 TraceCheckUtils]: 151: Hoare triple {22096#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,920 INFO L290 TraceCheckUtils]: 150: Hoare triple {22096#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,921 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {21591#true} {22096#(<= ~counter~0 17)} #63#return; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,921 INFO L290 TraceCheckUtils]: 148: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,921 INFO L290 TraceCheckUtils]: 147: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,921 INFO L290 TraceCheckUtils]: 146: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,921 INFO L272 TraceCheckUtils]: 145: Hoare triple {22096#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,921 INFO L290 TraceCheckUtils]: 144: Hoare triple {22096#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,922 INFO L290 TraceCheckUtils]: 143: Hoare triple {22068#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22096#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:33,922 INFO L290 TraceCheckUtils]: 142: Hoare triple {22068#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,922 INFO L290 TraceCheckUtils]: 141: Hoare triple {22068#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,923 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21591#true} {22068#(<= ~counter~0 16)} #63#return; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,923 INFO L290 TraceCheckUtils]: 139: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,923 INFO L290 TraceCheckUtils]: 138: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,923 INFO L290 TraceCheckUtils]: 137: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,923 INFO L272 TraceCheckUtils]: 136: Hoare triple {22068#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,923 INFO L290 TraceCheckUtils]: 135: Hoare triple {22068#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,924 INFO L290 TraceCheckUtils]: 134: Hoare triple {22040#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22068#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:33,924 INFO L290 TraceCheckUtils]: 133: Hoare triple {22040#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,924 INFO L290 TraceCheckUtils]: 132: Hoare triple {22040#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,925 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {21591#true} {22040#(<= ~counter~0 15)} #63#return; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,925 INFO L290 TraceCheckUtils]: 130: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,925 INFO L290 TraceCheckUtils]: 129: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,925 INFO L290 TraceCheckUtils]: 128: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,925 INFO L272 TraceCheckUtils]: 127: Hoare triple {22040#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,925 INFO L290 TraceCheckUtils]: 126: Hoare triple {22040#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,926 INFO L290 TraceCheckUtils]: 125: Hoare triple {22012#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22040#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:33,926 INFO L290 TraceCheckUtils]: 124: Hoare triple {22012#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,926 INFO L290 TraceCheckUtils]: 123: Hoare triple {22012#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,927 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21591#true} {22012#(<= ~counter~0 14)} #63#return; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,927 INFO L290 TraceCheckUtils]: 121: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,927 INFO L290 TraceCheckUtils]: 120: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,927 INFO L290 TraceCheckUtils]: 119: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,927 INFO L272 TraceCheckUtils]: 118: Hoare triple {22012#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,927 INFO L290 TraceCheckUtils]: 117: Hoare triple {22012#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,927 INFO L290 TraceCheckUtils]: 116: Hoare triple {21984#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22012#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:33,928 INFO L290 TraceCheckUtils]: 115: Hoare triple {21984#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,928 INFO L290 TraceCheckUtils]: 114: Hoare triple {21984#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,929 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21591#true} {21984#(<= ~counter~0 13)} #63#return; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,929 INFO L290 TraceCheckUtils]: 112: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,929 INFO L290 TraceCheckUtils]: 111: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,929 INFO L290 TraceCheckUtils]: 110: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,929 INFO L272 TraceCheckUtils]: 109: Hoare triple {21984#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,929 INFO L290 TraceCheckUtils]: 108: Hoare triple {21984#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,929 INFO L290 TraceCheckUtils]: 107: Hoare triple {21956#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21984#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:33,930 INFO L290 TraceCheckUtils]: 106: Hoare triple {21956#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,930 INFO L290 TraceCheckUtils]: 105: Hoare triple {21956#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,931 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21591#true} {21956#(<= ~counter~0 12)} #63#return; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,931 INFO L290 TraceCheckUtils]: 103: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,931 INFO L290 TraceCheckUtils]: 102: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,931 INFO L290 TraceCheckUtils]: 101: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,931 INFO L272 TraceCheckUtils]: 100: Hoare triple {21956#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,931 INFO L290 TraceCheckUtils]: 99: Hoare triple {21956#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,935 INFO L290 TraceCheckUtils]: 98: Hoare triple {21928#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21956#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:33,936 INFO L290 TraceCheckUtils]: 97: Hoare triple {21928#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {21928#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,937 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21591#true} {21928#(<= ~counter~0 11)} #63#return; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,937 INFO L290 TraceCheckUtils]: 94: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,937 INFO L290 TraceCheckUtils]: 93: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,937 INFO L290 TraceCheckUtils]: 92: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,937 INFO L272 TraceCheckUtils]: 91: Hoare triple {21928#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,937 INFO L290 TraceCheckUtils]: 90: Hoare triple {21928#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,938 INFO L290 TraceCheckUtils]: 89: Hoare triple {21900#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21928#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:33,938 INFO L290 TraceCheckUtils]: 88: Hoare triple {21900#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,939 INFO L290 TraceCheckUtils]: 87: Hoare triple {21900#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,939 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21591#true} {21900#(<= ~counter~0 10)} #63#return; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,940 INFO L272 TraceCheckUtils]: 82: Hoare triple {21900#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,940 INFO L290 TraceCheckUtils]: 81: Hoare triple {21900#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {21872#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21900#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:33,941 INFO L290 TraceCheckUtils]: 79: Hoare triple {21872#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {21872#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,942 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21591#true} {21872#(<= ~counter~0 9)} #63#return; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,942 INFO L290 TraceCheckUtils]: 75: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,942 INFO L272 TraceCheckUtils]: 73: Hoare triple {21872#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {21872#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {21844#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21872#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:33,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {21844#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {21844#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,945 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21591#true} {21844#(<= ~counter~0 8)} #63#return; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,945 INFO L272 TraceCheckUtils]: 64: Hoare triple {21844#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,945 INFO L290 TraceCheckUtils]: 63: Hoare triple {21844#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {21816#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21844#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:33,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {21816#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,947 INFO L290 TraceCheckUtils]: 60: Hoare triple {21816#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,947 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21591#true} {21816#(<= ~counter~0 7)} #63#return; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,948 INFO L272 TraceCheckUtils]: 55: Hoare triple {21816#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {21816#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {21788#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21816#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:33,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {21788#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {21788#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,950 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21591#true} {21788#(<= ~counter~0 6)} #63#return; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,950 INFO L272 TraceCheckUtils]: 46: Hoare triple {21788#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {21788#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {21760#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21788#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:33,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {21760#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {21760#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,953 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21591#true} {21760#(<= ~counter~0 5)} #63#return; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,953 INFO L272 TraceCheckUtils]: 37: Hoare triple {21760#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {21760#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {21732#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21760#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:33,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {21732#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {21732#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,955 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21591#true} {21732#(<= ~counter~0 4)} #63#return; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,955 INFO L272 TraceCheckUtils]: 28: Hoare triple {21732#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {21732#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {21704#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21732#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:33,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {21704#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {21704#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,958 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21591#true} {21704#(<= ~counter~0 3)} #63#return; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,958 INFO L272 TraceCheckUtils]: 19: Hoare triple {21704#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {21704#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {21676#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21704#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:33,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {21676#(<= ~counter~0 2)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,960 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21591#true} {21676#(<= ~counter~0 2)} #61#return; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,960 INFO L272 TraceCheckUtils]: 11: Hoare triple {21676#(<= ~counter~0 2)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21591#true} {21676#(<= ~counter~0 2)} #59#return; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {21591#true} assume true; {21591#true} is VALID [2022-04-28 13:57:33,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {21591#true} assume !(0 == ~cond); {21591#true} is VALID [2022-04-28 13:57:33,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {21591#true} ~cond := #in~cond; {21591#true} is VALID [2022-04-28 13:57:33,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {21676#(<= ~counter~0 2)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {21591#true} is VALID [2022-04-28 13:57:33,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {21676#(<= ~counter~0 2)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {21676#(<= ~counter~0 2)} call #t~ret7 := main(); {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21676#(<= ~counter~0 2)} {21591#true} #67#return; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {21676#(<= ~counter~0 2)} assume true; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {21591#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21676#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:33,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {21591#true} call ULTIMATE.init(); {21591#true} is VALID [2022-04-28 13:57:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 34 proven. 714 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 13:57:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097531108] [2022-04-28 13:57:33,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347418550] [2022-04-28 13:57:33,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347418550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:33,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:33,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-28 13:57:33,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:33,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233987787] [2022-04-28 13:57:33,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233987787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:33,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:33,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 13:57:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016644580] [2022-04-28 13:57:33,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 176 [2022-04-28 13:57:33,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:33,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 13:57:34,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:34,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 13:57:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 13:57:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:34,103 INFO L87 Difference]: Start difference. First operand 173 states and 191 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 13:57:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:35,010 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2022-04-28 13:57:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 13:57:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 176 [2022-04-28 13:57:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 13:57:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 205 transitions. [2022-04-28 13:57:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 13:57:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 205 transitions. [2022-04-28 13:57:35,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 205 transitions. [2022-04-28 13:57:35,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:35,193 INFO L225 Difference]: With dead ends: 187 [2022-04-28 13:57:35,193 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 13:57:35,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=627, Invalid=1013, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 13:57:35,195 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:35,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 230 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:57:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 13:57:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-28 13:57:35,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:35,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:57:35,445 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:57:35,445 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:57:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:35,448 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-04-28 13:57:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-28 13:57:35,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:35,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:35,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 182 states. [2022-04-28 13:57:35,449 INFO L87 Difference]: Start difference. First operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 182 states. [2022-04-28 13:57:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:35,452 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-04-28 13:57:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-28 13:57:35,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:35,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:35,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:35,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 13:57:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2022-04-28 13:57:35,456 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 176 [2022-04-28 13:57:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:35,456 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2022-04-28 13:57:35,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 13:57:35,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 201 transitions. [2022-04-28 13:57:35,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-28 13:57:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-28 13:57:35,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:35,710 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:35,735 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 13:57:35,911 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 13:57:35,911 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 994740182, now seen corresponding path program 35 times [2022-04-28 13:57:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385448389] [2022-04-28 13:57:35,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash 994740182, now seen corresponding path program 36 times [2022-04-28 13:57:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252230341] [2022-04-28 13:57:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:35,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:35,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336878478] [2022-04-28 13:57:35,935 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:57:35,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:35,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:35,936 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 13:57:35,937 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 13:57:36,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 13:57:36,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:36,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 13:57:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:36,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:37,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {23806#true} call ULTIMATE.init(); {23806#true} is VALID [2022-04-28 13:57:37,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {23806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {23814#(<= ~counter~0 0)} assume true; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23814#(<= ~counter~0 0)} {23806#true} #67#return; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {23814#(<= ~counter~0 0)} call #t~ret7 := main(); {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {23814#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {23814#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {23814#(<= ~counter~0 0)} ~cond := #in~cond; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {23814#(<= ~counter~0 0)} assume !(0 == ~cond); {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {23814#(<= ~counter~0 0)} assume true; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23814#(<= ~counter~0 0)} {23814#(<= ~counter~0 0)} #59#return; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {23814#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {23814#(<= ~counter~0 0)} ~cond := #in~cond; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {23814#(<= ~counter~0 0)} assume !(0 == ~cond); {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {23814#(<= ~counter~0 0)} assume true; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23814#(<= ~counter~0 0)} {23814#(<= ~counter~0 0)} #61#return; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {23814#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {23814#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:37,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {23814#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {23863#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,053 INFO L272 TraceCheckUtils]: 19: Hoare triple {23863#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {23863#(<= ~counter~0 1)} ~cond := #in~cond; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {23863#(<= ~counter~0 1)} assume !(0 == ~cond); {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {23863#(<= ~counter~0 1)} assume true; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,055 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23863#(<= ~counter~0 1)} {23863#(<= ~counter~0 1)} #63#return; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {23863#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {23863#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:37,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {23863#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {23891#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,056 INFO L272 TraceCheckUtils]: 28: Hoare triple {23891#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {23891#(<= ~counter~0 2)} ~cond := #in~cond; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {23891#(<= ~counter~0 2)} assume !(0 == ~cond); {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {23891#(<= ~counter~0 2)} assume true; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,058 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23891#(<= ~counter~0 2)} {23891#(<= ~counter~0 2)} #63#return; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {23891#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {23891#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:37,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {23891#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {23919#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,060 INFO L272 TraceCheckUtils]: 37: Hoare triple {23919#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {23919#(<= ~counter~0 3)} ~cond := #in~cond; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {23919#(<= ~counter~0 3)} assume !(0 == ~cond); {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {23919#(<= ~counter~0 3)} assume true; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,061 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23919#(<= ~counter~0 3)} {23919#(<= ~counter~0 3)} #63#return; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {23919#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {23919#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:37,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {23919#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {23947#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,063 INFO L272 TraceCheckUtils]: 46: Hoare triple {23947#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {23947#(<= ~counter~0 4)} ~cond := #in~cond; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {23947#(<= ~counter~0 4)} assume !(0 == ~cond); {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {23947#(<= ~counter~0 4)} assume true; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,064 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23947#(<= ~counter~0 4)} {23947#(<= ~counter~0 4)} #63#return; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {23947#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {23947#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:37,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {23947#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {23975#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,066 INFO L272 TraceCheckUtils]: 55: Hoare triple {23975#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {23975#(<= ~counter~0 5)} ~cond := #in~cond; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {23975#(<= ~counter~0 5)} assume !(0 == ~cond); {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {23975#(<= ~counter~0 5)} assume true; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,067 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23975#(<= ~counter~0 5)} {23975#(<= ~counter~0 5)} #63#return; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {23975#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {23975#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:37,068 INFO L290 TraceCheckUtils]: 62: Hoare triple {23975#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {24003#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,069 INFO L272 TraceCheckUtils]: 64: Hoare triple {24003#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,069 INFO L290 TraceCheckUtils]: 65: Hoare triple {24003#(<= ~counter~0 6)} ~cond := #in~cond; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,069 INFO L290 TraceCheckUtils]: 66: Hoare triple {24003#(<= ~counter~0 6)} assume !(0 == ~cond); {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {24003#(<= ~counter~0 6)} assume true; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,070 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24003#(<= ~counter~0 6)} {24003#(<= ~counter~0 6)} #63#return; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {24003#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {24003#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:37,071 INFO L290 TraceCheckUtils]: 71: Hoare triple {24003#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {24031#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,072 INFO L272 TraceCheckUtils]: 73: Hoare triple {24031#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {24031#(<= ~counter~0 7)} ~cond := #in~cond; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,073 INFO L290 TraceCheckUtils]: 75: Hoare triple {24031#(<= ~counter~0 7)} assume !(0 == ~cond); {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {24031#(<= ~counter~0 7)} assume true; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,073 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {24031#(<= ~counter~0 7)} {24031#(<= ~counter~0 7)} #63#return; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,074 INFO L290 TraceCheckUtils]: 78: Hoare triple {24031#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,074 INFO L290 TraceCheckUtils]: 79: Hoare triple {24031#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:37,074 INFO L290 TraceCheckUtils]: 80: Hoare triple {24031#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,075 INFO L290 TraceCheckUtils]: 81: Hoare triple {24059#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,075 INFO L272 TraceCheckUtils]: 82: Hoare triple {24059#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,075 INFO L290 TraceCheckUtils]: 83: Hoare triple {24059#(<= ~counter~0 8)} ~cond := #in~cond; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,076 INFO L290 TraceCheckUtils]: 84: Hoare triple {24059#(<= ~counter~0 8)} assume !(0 == ~cond); {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,076 INFO L290 TraceCheckUtils]: 85: Hoare triple {24059#(<= ~counter~0 8)} assume true; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,076 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {24059#(<= ~counter~0 8)} {24059#(<= ~counter~0 8)} #63#return; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {24059#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {24059#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:37,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {24059#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,078 INFO L290 TraceCheckUtils]: 90: Hoare triple {24087#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,078 INFO L272 TraceCheckUtils]: 91: Hoare triple {24087#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {24087#(<= ~counter~0 9)} ~cond := #in~cond; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {24087#(<= ~counter~0 9)} assume !(0 == ~cond); {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,079 INFO L290 TraceCheckUtils]: 94: Hoare triple {24087#(<= ~counter~0 9)} assume true; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,080 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24087#(<= ~counter~0 9)} {24087#(<= ~counter~0 9)} #63#return; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,080 INFO L290 TraceCheckUtils]: 96: Hoare triple {24087#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,080 INFO L290 TraceCheckUtils]: 97: Hoare triple {24087#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:37,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {24087#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,081 INFO L290 TraceCheckUtils]: 99: Hoare triple {24115#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,081 INFO L272 TraceCheckUtils]: 100: Hoare triple {24115#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,082 INFO L290 TraceCheckUtils]: 101: Hoare triple {24115#(<= ~counter~0 10)} ~cond := #in~cond; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,082 INFO L290 TraceCheckUtils]: 102: Hoare triple {24115#(<= ~counter~0 10)} assume !(0 == ~cond); {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,082 INFO L290 TraceCheckUtils]: 103: Hoare triple {24115#(<= ~counter~0 10)} assume true; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,083 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24115#(<= ~counter~0 10)} {24115#(<= ~counter~0 10)} #63#return; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,083 INFO L290 TraceCheckUtils]: 105: Hoare triple {24115#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,083 INFO L290 TraceCheckUtils]: 106: Hoare triple {24115#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:37,084 INFO L290 TraceCheckUtils]: 107: Hoare triple {24115#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {24143#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,085 INFO L272 TraceCheckUtils]: 109: Hoare triple {24143#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {24143#(<= ~counter~0 11)} ~cond := #in~cond; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,085 INFO L290 TraceCheckUtils]: 111: Hoare triple {24143#(<= ~counter~0 11)} assume !(0 == ~cond); {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,085 INFO L290 TraceCheckUtils]: 112: Hoare triple {24143#(<= ~counter~0 11)} assume true; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,086 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {24143#(<= ~counter~0 11)} {24143#(<= ~counter~0 11)} #63#return; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,086 INFO L290 TraceCheckUtils]: 114: Hoare triple {24143#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,086 INFO L290 TraceCheckUtils]: 115: Hoare triple {24143#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:37,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {24143#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,087 INFO L290 TraceCheckUtils]: 117: Hoare triple {24171#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,088 INFO L272 TraceCheckUtils]: 118: Hoare triple {24171#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,088 INFO L290 TraceCheckUtils]: 119: Hoare triple {24171#(<= ~counter~0 12)} ~cond := #in~cond; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,088 INFO L290 TraceCheckUtils]: 120: Hoare triple {24171#(<= ~counter~0 12)} assume !(0 == ~cond); {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,088 INFO L290 TraceCheckUtils]: 121: Hoare triple {24171#(<= ~counter~0 12)} assume true; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,089 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24171#(<= ~counter~0 12)} {24171#(<= ~counter~0 12)} #63#return; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,089 INFO L290 TraceCheckUtils]: 123: Hoare triple {24171#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,089 INFO L290 TraceCheckUtils]: 124: Hoare triple {24171#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:37,090 INFO L290 TraceCheckUtils]: 125: Hoare triple {24171#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,090 INFO L290 TraceCheckUtils]: 126: Hoare triple {24199#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,091 INFO L272 TraceCheckUtils]: 127: Hoare triple {24199#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,091 INFO L290 TraceCheckUtils]: 128: Hoare triple {24199#(<= ~counter~0 13)} ~cond := #in~cond; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,091 INFO L290 TraceCheckUtils]: 129: Hoare triple {24199#(<= ~counter~0 13)} assume !(0 == ~cond); {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,092 INFO L290 TraceCheckUtils]: 130: Hoare triple {24199#(<= ~counter~0 13)} assume true; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,092 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {24199#(<= ~counter~0 13)} {24199#(<= ~counter~0 13)} #63#return; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,092 INFO L290 TraceCheckUtils]: 132: Hoare triple {24199#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,093 INFO L290 TraceCheckUtils]: 133: Hoare triple {24199#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:37,093 INFO L290 TraceCheckUtils]: 134: Hoare triple {24199#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,093 INFO L290 TraceCheckUtils]: 135: Hoare triple {24227#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,094 INFO L272 TraceCheckUtils]: 136: Hoare triple {24227#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,094 INFO L290 TraceCheckUtils]: 137: Hoare triple {24227#(<= ~counter~0 14)} ~cond := #in~cond; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,094 INFO L290 TraceCheckUtils]: 138: Hoare triple {24227#(<= ~counter~0 14)} assume !(0 == ~cond); {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,095 INFO L290 TraceCheckUtils]: 139: Hoare triple {24227#(<= ~counter~0 14)} assume true; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,095 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {24227#(<= ~counter~0 14)} {24227#(<= ~counter~0 14)} #63#return; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,095 INFO L290 TraceCheckUtils]: 141: Hoare triple {24227#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,096 INFO L290 TraceCheckUtils]: 142: Hoare triple {24227#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:37,096 INFO L290 TraceCheckUtils]: 143: Hoare triple {24227#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,096 INFO L290 TraceCheckUtils]: 144: Hoare triple {24255#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,097 INFO L272 TraceCheckUtils]: 145: Hoare triple {24255#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,097 INFO L290 TraceCheckUtils]: 146: Hoare triple {24255#(<= ~counter~0 15)} ~cond := #in~cond; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,097 INFO L290 TraceCheckUtils]: 147: Hoare triple {24255#(<= ~counter~0 15)} assume !(0 == ~cond); {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,098 INFO L290 TraceCheckUtils]: 148: Hoare triple {24255#(<= ~counter~0 15)} assume true; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,098 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {24255#(<= ~counter~0 15)} {24255#(<= ~counter~0 15)} #63#return; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,099 INFO L290 TraceCheckUtils]: 150: Hoare triple {24255#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,099 INFO L290 TraceCheckUtils]: 151: Hoare triple {24255#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:37,099 INFO L290 TraceCheckUtils]: 152: Hoare triple {24255#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,100 INFO L290 TraceCheckUtils]: 153: Hoare triple {24283#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,100 INFO L272 TraceCheckUtils]: 154: Hoare triple {24283#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,100 INFO L290 TraceCheckUtils]: 155: Hoare triple {24283#(<= ~counter~0 16)} ~cond := #in~cond; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,101 INFO L290 TraceCheckUtils]: 156: Hoare triple {24283#(<= ~counter~0 16)} assume !(0 == ~cond); {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,101 INFO L290 TraceCheckUtils]: 157: Hoare triple {24283#(<= ~counter~0 16)} assume true; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,101 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {24283#(<= ~counter~0 16)} {24283#(<= ~counter~0 16)} #63#return; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,102 INFO L290 TraceCheckUtils]: 159: Hoare triple {24283#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,102 INFO L290 TraceCheckUtils]: 160: Hoare triple {24283#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:37,102 INFO L290 TraceCheckUtils]: 161: Hoare triple {24283#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,103 INFO L290 TraceCheckUtils]: 162: Hoare triple {24311#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,103 INFO L272 TraceCheckUtils]: 163: Hoare triple {24311#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,104 INFO L290 TraceCheckUtils]: 164: Hoare triple {24311#(<= ~counter~0 17)} ~cond := #in~cond; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,104 INFO L290 TraceCheckUtils]: 165: Hoare triple {24311#(<= ~counter~0 17)} assume !(0 == ~cond); {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,104 INFO L290 TraceCheckUtils]: 166: Hoare triple {24311#(<= ~counter~0 17)} assume true; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,105 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {24311#(<= ~counter~0 17)} {24311#(<= ~counter~0 17)} #63#return; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,105 INFO L290 TraceCheckUtils]: 168: Hoare triple {24311#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,105 INFO L290 TraceCheckUtils]: 169: Hoare triple {24311#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:37,106 INFO L290 TraceCheckUtils]: 170: Hoare triple {24311#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,106 INFO L290 TraceCheckUtils]: 171: Hoare triple {24339#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,106 INFO L272 TraceCheckUtils]: 172: Hoare triple {24339#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,107 INFO L290 TraceCheckUtils]: 173: Hoare triple {24339#(<= ~counter~0 18)} ~cond := #in~cond; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,107 INFO L290 TraceCheckUtils]: 174: Hoare triple {24339#(<= ~counter~0 18)} assume !(0 == ~cond); {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,107 INFO L290 TraceCheckUtils]: 175: Hoare triple {24339#(<= ~counter~0 18)} assume true; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,108 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {24339#(<= ~counter~0 18)} {24339#(<= ~counter~0 18)} #63#return; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,108 INFO L290 TraceCheckUtils]: 177: Hoare triple {24339#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,108 INFO L290 TraceCheckUtils]: 178: Hoare triple {24339#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:37,109 INFO L290 TraceCheckUtils]: 179: Hoare triple {24339#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24367#(<= |main_#t~post6| 18)} is VALID [2022-04-28 13:57:37,109 INFO L290 TraceCheckUtils]: 180: Hoare triple {24367#(<= |main_#t~post6| 18)} assume !(#t~post6 < 20);havoc #t~post6; {23807#false} is VALID [2022-04-28 13:57:37,109 INFO L272 TraceCheckUtils]: 181: Hoare triple {23807#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {23807#false} is VALID [2022-04-28 13:57:37,109 INFO L290 TraceCheckUtils]: 182: Hoare triple {23807#false} ~cond := #in~cond; {23807#false} is VALID [2022-04-28 13:57:37,109 INFO L290 TraceCheckUtils]: 183: Hoare triple {23807#false} assume 0 == ~cond; {23807#false} is VALID [2022-04-28 13:57:37,109 INFO L290 TraceCheckUtils]: 184: Hoare triple {23807#false} assume !false; {23807#false} is VALID [2022-04-28 13:57:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 36 proven. 1413 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:37,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:38,015 INFO L290 TraceCheckUtils]: 184: Hoare triple {23807#false} assume !false; {23807#false} is VALID [2022-04-28 13:57:38,015 INFO L290 TraceCheckUtils]: 183: Hoare triple {23807#false} assume 0 == ~cond; {23807#false} is VALID [2022-04-28 13:57:38,015 INFO L290 TraceCheckUtils]: 182: Hoare triple {23807#false} ~cond := #in~cond; {23807#false} is VALID [2022-04-28 13:57:38,015 INFO L272 TraceCheckUtils]: 181: Hoare triple {23807#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {23807#false} is VALID [2022-04-28 13:57:38,016 INFO L290 TraceCheckUtils]: 180: Hoare triple {24395#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {23807#false} is VALID [2022-04-28 13:57:38,016 INFO L290 TraceCheckUtils]: 179: Hoare triple {24399#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24395#(< |main_#t~post6| 20)} is VALID [2022-04-28 13:57:38,016 INFO L290 TraceCheckUtils]: 178: Hoare triple {24399#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24399#(< ~counter~0 20)} is VALID [2022-04-28 13:57:38,017 INFO L290 TraceCheckUtils]: 177: Hoare triple {24399#(< ~counter~0 20)} assume !!(0 != ~y3~0); {24399#(< ~counter~0 20)} is VALID [2022-04-28 13:57:38,017 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {23806#true} {24399#(< ~counter~0 20)} #63#return; {24399#(< ~counter~0 20)} is VALID [2022-04-28 13:57:38,017 INFO L290 TraceCheckUtils]: 175: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,017 INFO L290 TraceCheckUtils]: 174: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,017 INFO L290 TraceCheckUtils]: 173: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,017 INFO L272 TraceCheckUtils]: 172: Hoare triple {24399#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,018 INFO L290 TraceCheckUtils]: 171: Hoare triple {24399#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {24399#(< ~counter~0 20)} is VALID [2022-04-28 13:57:38,018 INFO L290 TraceCheckUtils]: 170: Hoare triple {24339#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24399#(< ~counter~0 20)} is VALID [2022-04-28 13:57:38,019 INFO L290 TraceCheckUtils]: 169: Hoare triple {24339#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:38,019 INFO L290 TraceCheckUtils]: 168: Hoare triple {24339#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:38,019 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {23806#true} {24339#(<= ~counter~0 18)} #63#return; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:38,020 INFO L290 TraceCheckUtils]: 166: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,020 INFO L290 TraceCheckUtils]: 165: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,020 INFO L290 TraceCheckUtils]: 164: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,020 INFO L272 TraceCheckUtils]: 163: Hoare triple {24339#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,020 INFO L290 TraceCheckUtils]: 162: Hoare triple {24339#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:38,020 INFO L290 TraceCheckUtils]: 161: Hoare triple {24311#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24339#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:38,021 INFO L290 TraceCheckUtils]: 160: Hoare triple {24311#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:38,021 INFO L290 TraceCheckUtils]: 159: Hoare triple {24311#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:38,021 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {23806#true} {24311#(<= ~counter~0 17)} #63#return; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:38,022 INFO L290 TraceCheckUtils]: 157: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,022 INFO L290 TraceCheckUtils]: 156: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,022 INFO L290 TraceCheckUtils]: 155: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,022 INFO L272 TraceCheckUtils]: 154: Hoare triple {24311#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,022 INFO L290 TraceCheckUtils]: 153: Hoare triple {24311#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:38,022 INFO L290 TraceCheckUtils]: 152: Hoare triple {24283#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24311#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:38,023 INFO L290 TraceCheckUtils]: 151: Hoare triple {24283#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:38,023 INFO L290 TraceCheckUtils]: 150: Hoare triple {24283#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:38,024 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {23806#true} {24283#(<= ~counter~0 16)} #63#return; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:38,024 INFO L290 TraceCheckUtils]: 148: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,024 INFO L290 TraceCheckUtils]: 147: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,024 INFO L290 TraceCheckUtils]: 146: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,024 INFO L272 TraceCheckUtils]: 145: Hoare triple {24283#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,024 INFO L290 TraceCheckUtils]: 144: Hoare triple {24283#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:38,025 INFO L290 TraceCheckUtils]: 143: Hoare triple {24255#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24283#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:38,025 INFO L290 TraceCheckUtils]: 142: Hoare triple {24255#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:38,025 INFO L290 TraceCheckUtils]: 141: Hoare triple {24255#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:38,026 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23806#true} {24255#(<= ~counter~0 15)} #63#return; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:38,026 INFO L290 TraceCheckUtils]: 139: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,026 INFO L290 TraceCheckUtils]: 138: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,026 INFO L290 TraceCheckUtils]: 137: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,026 INFO L272 TraceCheckUtils]: 136: Hoare triple {24255#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,026 INFO L290 TraceCheckUtils]: 135: Hoare triple {24255#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:38,027 INFO L290 TraceCheckUtils]: 134: Hoare triple {24227#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24255#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:38,027 INFO L290 TraceCheckUtils]: 133: Hoare triple {24227#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:38,027 INFO L290 TraceCheckUtils]: 132: Hoare triple {24227#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:38,028 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {23806#true} {24227#(<= ~counter~0 14)} #63#return; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:38,028 INFO L290 TraceCheckUtils]: 130: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,028 INFO L290 TraceCheckUtils]: 129: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,028 INFO L290 TraceCheckUtils]: 128: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,028 INFO L272 TraceCheckUtils]: 127: Hoare triple {24227#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,028 INFO L290 TraceCheckUtils]: 126: Hoare triple {24227#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:38,029 INFO L290 TraceCheckUtils]: 125: Hoare triple {24199#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24227#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:38,029 INFO L290 TraceCheckUtils]: 124: Hoare triple {24199#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:38,029 INFO L290 TraceCheckUtils]: 123: Hoare triple {24199#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:38,030 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23806#true} {24199#(<= ~counter~0 13)} #63#return; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:38,030 INFO L290 TraceCheckUtils]: 121: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,030 INFO L290 TraceCheckUtils]: 120: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,030 INFO L290 TraceCheckUtils]: 119: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,030 INFO L272 TraceCheckUtils]: 118: Hoare triple {24199#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,030 INFO L290 TraceCheckUtils]: 117: Hoare triple {24199#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:38,031 INFO L290 TraceCheckUtils]: 116: Hoare triple {24171#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24199#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:38,031 INFO L290 TraceCheckUtils]: 115: Hoare triple {24171#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:38,031 INFO L290 TraceCheckUtils]: 114: Hoare triple {24171#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:38,032 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23806#true} {24171#(<= ~counter~0 12)} #63#return; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:38,032 INFO L290 TraceCheckUtils]: 112: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,032 INFO L290 TraceCheckUtils]: 111: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,032 INFO L290 TraceCheckUtils]: 110: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,032 INFO L272 TraceCheckUtils]: 109: Hoare triple {24171#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,032 INFO L290 TraceCheckUtils]: 108: Hoare triple {24171#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:38,033 INFO L290 TraceCheckUtils]: 107: Hoare triple {24143#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24171#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:38,033 INFO L290 TraceCheckUtils]: 106: Hoare triple {24143#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:38,033 INFO L290 TraceCheckUtils]: 105: Hoare triple {24143#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:38,034 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {23806#true} {24143#(<= ~counter~0 11)} #63#return; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:38,034 INFO L290 TraceCheckUtils]: 103: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,034 INFO L290 TraceCheckUtils]: 102: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,034 INFO L290 TraceCheckUtils]: 101: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,034 INFO L272 TraceCheckUtils]: 100: Hoare triple {24143#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,034 INFO L290 TraceCheckUtils]: 99: Hoare triple {24143#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:38,035 INFO L290 TraceCheckUtils]: 98: Hoare triple {24115#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24143#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:38,035 INFO L290 TraceCheckUtils]: 97: Hoare triple {24115#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:38,035 INFO L290 TraceCheckUtils]: 96: Hoare triple {24115#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:38,036 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23806#true} {24115#(<= ~counter~0 10)} #63#return; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:38,036 INFO L290 TraceCheckUtils]: 94: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,036 INFO L290 TraceCheckUtils]: 93: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,036 INFO L272 TraceCheckUtils]: 91: Hoare triple {24115#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,036 INFO L290 TraceCheckUtils]: 90: Hoare triple {24115#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:38,037 INFO L290 TraceCheckUtils]: 89: Hoare triple {24087#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24115#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:38,037 INFO L290 TraceCheckUtils]: 88: Hoare triple {24087#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:38,037 INFO L290 TraceCheckUtils]: 87: Hoare triple {24087#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:38,038 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23806#true} {24087#(<= ~counter~0 9)} #63#return; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:38,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,038 INFO L290 TraceCheckUtils]: 83: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,038 INFO L272 TraceCheckUtils]: 82: Hoare triple {24087#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {24087#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:38,039 INFO L290 TraceCheckUtils]: 80: Hoare triple {24059#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24087#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:38,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {24059#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:38,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {24059#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:38,040 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23806#true} {24059#(<= ~counter~0 8)} #63#return; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:38,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,040 INFO L272 TraceCheckUtils]: 73: Hoare triple {24059#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {24059#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:38,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {24031#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24059#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:38,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {24031#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:38,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {24031#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:38,042 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23806#true} {24031#(<= ~counter~0 7)} #63#return; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:38,042 INFO L290 TraceCheckUtils]: 67: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,042 INFO L290 TraceCheckUtils]: 66: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,042 INFO L272 TraceCheckUtils]: 64: Hoare triple {24031#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {24031#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:38,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {24003#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24031#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:38,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {24003#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:38,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {24003#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:38,044 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23806#true} {24003#(<= ~counter~0 6)} #63#return; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:38,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,044 INFO L272 TraceCheckUtils]: 55: Hoare triple {24003#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {24003#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:38,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {23975#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24003#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:38,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {23975#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:38,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {23975#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:38,046 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23806#true} {23975#(<= ~counter~0 5)} #63#return; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:38,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,046 INFO L290 TraceCheckUtils]: 47: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,046 INFO L272 TraceCheckUtils]: 46: Hoare triple {23975#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {23975#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:38,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {23947#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23975#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:38,047 INFO L290 TraceCheckUtils]: 43: Hoare triple {23947#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:38,047 INFO L290 TraceCheckUtils]: 42: Hoare triple {23947#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:38,048 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23806#true} {23947#(<= ~counter~0 4)} #63#return; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:38,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,048 INFO L272 TraceCheckUtils]: 37: Hoare triple {23947#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {23947#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:38,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {23919#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23947#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:38,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {23919#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:38,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {23919#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:38,050 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23806#true} {23919#(<= ~counter~0 3)} #63#return; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:38,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,050 INFO L272 TraceCheckUtils]: 28: Hoare triple {23919#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {23919#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:38,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {23891#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23919#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:38,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {23891#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:38,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {23891#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:38,054 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23806#true} {23891#(<= ~counter~0 2)} #63#return; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:38,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,054 INFO L272 TraceCheckUtils]: 19: Hoare triple {23891#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {23891#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:38,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {23863#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23891#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:38,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {23863#(<= ~counter~0 1)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23806#true} {23863#(<= ~counter~0 1)} #61#return; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {23863#(<= ~counter~0 1)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23806#true} {23863#(<= ~counter~0 1)} #59#return; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {23806#true} assume true; {23806#true} is VALID [2022-04-28 13:57:38,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {23806#true} assume !(0 == ~cond); {23806#true} is VALID [2022-04-28 13:57:38,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {23806#true} ~cond := #in~cond; {23806#true} is VALID [2022-04-28 13:57:38,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {23863#(<= ~counter~0 1)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {23806#true} is VALID [2022-04-28 13:57:38,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {23863#(<= ~counter~0 1)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {23863#(<= ~counter~0 1)} call #t~ret7 := main(); {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23863#(<= ~counter~0 1)} {23806#true} #67#return; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {23863#(<= ~counter~0 1)} assume true; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {23806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23863#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:38,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {23806#true} call ULTIMATE.init(); {23806#true} is VALID [2022-04-28 13:57:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 36 proven. 801 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-28 13:57:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:38,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252230341] [2022-04-28 13:57:38,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:38,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336878478] [2022-04-28 13:57:38,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336878478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:38,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:38,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-28 13:57:38,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:38,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385448389] [2022-04-28 13:57:38,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385448389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:38,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:38,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 13:57:38,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032988765] [2022-04-28 13:57:38,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:38,076 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 185 [2022-04-28 13:57:38,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:38,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 13:57:38,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:38,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 13:57:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 13:57:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 13:57:38,228 INFO L87 Difference]: Start difference. First operand 182 states and 201 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 13:57:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:39,022 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2022-04-28 13:57:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 13:57:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 185 [2022-04-28 13:57:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 13:57:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 215 transitions. [2022-04-28 13:57:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 13:57:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 215 transitions. [2022-04-28 13:57:39,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 215 transitions. [2022-04-28 13:57:39,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:39,193 INFO L225 Difference]: With dead ends: 196 [2022-04-28 13:57:39,194 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 13:57:39,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=650, Invalid=1072, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 13:57:39,195 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 59 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:39,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 238 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 13:57:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 13:57:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-04-28 13:57:39,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:39,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 13:57:39,444 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 13:57:39,445 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 13:57:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:39,448 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-04-28 13:57:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-28 13:57:39,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:39,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:39,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 191 states. [2022-04-28 13:57:39,449 INFO L87 Difference]: Start difference. First operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 191 states. [2022-04-28 13:57:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:39,452 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-04-28 13:57:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-28 13:57:39,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:39,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:39,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:39,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 13:57:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2022-04-28 13:57:39,456 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 185 [2022-04-28 13:57:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:39,457 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2022-04-28 13:57:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 13:57:39,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 211 transitions. [2022-04-28 13:57:39,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-28 13:57:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-28 13:57:39,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:39,730 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:39,754 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 13:57:39,931 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 13:57:39,931 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1522264156, now seen corresponding path program 37 times [2022-04-28 13:57:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:39,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [622395209] [2022-04-28 13:57:39,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1522264156, now seen corresponding path program 38 times [2022-04-28 13:57:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:39,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715441177] [2022-04-28 13:57:39,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:39,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45922675] [2022-04-28 13:57:39,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:39,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:39,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:39,954 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 13:57:39,955 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 13:57:40,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:40,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:40,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 13:57:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:40,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:41,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {26131#true} call ULTIMATE.init(); {26131#true} is VALID [2022-04-28 13:57:41,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {26139#(<= ~counter~0 0)} assume true; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26139#(<= ~counter~0 0)} {26131#true} #67#return; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {26139#(<= ~counter~0 0)} call #t~ret7 := main(); {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {26139#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,104 INFO L272 TraceCheckUtils]: 6: Hoare triple {26139#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {26139#(<= ~counter~0 0)} ~cond := #in~cond; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {26139#(<= ~counter~0 0)} assume !(0 == ~cond); {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {26139#(<= ~counter~0 0)} assume true; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26139#(<= ~counter~0 0)} {26139#(<= ~counter~0 0)} #59#return; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,106 INFO L272 TraceCheckUtils]: 11: Hoare triple {26139#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {26139#(<= ~counter~0 0)} ~cond := #in~cond; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {26139#(<= ~counter~0 0)} assume !(0 == ~cond); {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {26139#(<= ~counter~0 0)} assume true; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,116 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26139#(<= ~counter~0 0)} {26139#(<= ~counter~0 0)} #61#return; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {26139#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:41,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {26139#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {26188#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,119 INFO L272 TraceCheckUtils]: 19: Hoare triple {26188#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {26188#(<= ~counter~0 1)} ~cond := #in~cond; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {26188#(<= ~counter~0 1)} assume !(0 == ~cond); {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {26188#(<= ~counter~0 1)} assume true; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26188#(<= ~counter~0 1)} {26188#(<= ~counter~0 1)} #63#return; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {26188#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {26188#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:41,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {26188#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {26216#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,125 INFO L272 TraceCheckUtils]: 28: Hoare triple {26216#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {26216#(<= ~counter~0 2)} ~cond := #in~cond; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {26216#(<= ~counter~0 2)} assume !(0 == ~cond); {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {26216#(<= ~counter~0 2)} assume true; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,127 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26216#(<= ~counter~0 2)} {26216#(<= ~counter~0 2)} #63#return; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {26216#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {26216#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:41,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {26216#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {26244#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,129 INFO L272 TraceCheckUtils]: 37: Hoare triple {26244#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {26244#(<= ~counter~0 3)} ~cond := #in~cond; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {26244#(<= ~counter~0 3)} assume !(0 == ~cond); {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {26244#(<= ~counter~0 3)} assume true; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,131 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {26244#(<= ~counter~0 3)} {26244#(<= ~counter~0 3)} #63#return; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {26244#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {26244#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:41,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {26244#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {26272#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,133 INFO L272 TraceCheckUtils]: 46: Hoare triple {26272#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {26272#(<= ~counter~0 4)} ~cond := #in~cond; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {26272#(<= ~counter~0 4)} assume !(0 == ~cond); {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {26272#(<= ~counter~0 4)} assume true; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,135 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26272#(<= ~counter~0 4)} {26272#(<= ~counter~0 4)} #63#return; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {26272#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {26272#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:41,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {26272#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {26300#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,137 INFO L272 TraceCheckUtils]: 55: Hoare triple {26300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {26300#(<= ~counter~0 5)} ~cond := #in~cond; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {26300#(<= ~counter~0 5)} assume !(0 == ~cond); {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {26300#(<= ~counter~0 5)} assume true; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,138 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26300#(<= ~counter~0 5)} {26300#(<= ~counter~0 5)} #63#return; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {26300#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {26300#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:41,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {26300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {26328#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,141 INFO L272 TraceCheckUtils]: 64: Hoare triple {26328#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {26328#(<= ~counter~0 6)} ~cond := #in~cond; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {26328#(<= ~counter~0 6)} assume !(0 == ~cond); {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {26328#(<= ~counter~0 6)} assume true; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,143 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26328#(<= ~counter~0 6)} {26328#(<= ~counter~0 6)} #63#return; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {26328#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {26328#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:41,144 INFO L290 TraceCheckUtils]: 71: Hoare triple {26328#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {26356#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,145 INFO L272 TraceCheckUtils]: 73: Hoare triple {26356#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {26356#(<= ~counter~0 7)} ~cond := #in~cond; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,146 INFO L290 TraceCheckUtils]: 75: Hoare triple {26356#(<= ~counter~0 7)} assume !(0 == ~cond); {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,146 INFO L290 TraceCheckUtils]: 76: Hoare triple {26356#(<= ~counter~0 7)} assume true; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,147 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {26356#(<= ~counter~0 7)} {26356#(<= ~counter~0 7)} #63#return; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {26356#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,147 INFO L290 TraceCheckUtils]: 79: Hoare triple {26356#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:41,148 INFO L290 TraceCheckUtils]: 80: Hoare triple {26356#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,148 INFO L290 TraceCheckUtils]: 81: Hoare triple {26384#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,149 INFO L272 TraceCheckUtils]: 82: Hoare triple {26384#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,149 INFO L290 TraceCheckUtils]: 83: Hoare triple {26384#(<= ~counter~0 8)} ~cond := #in~cond; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {26384#(<= ~counter~0 8)} assume !(0 == ~cond); {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,149 INFO L290 TraceCheckUtils]: 85: Hoare triple {26384#(<= ~counter~0 8)} assume true; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,150 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26384#(<= ~counter~0 8)} {26384#(<= ~counter~0 8)} #63#return; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,150 INFO L290 TraceCheckUtils]: 87: Hoare triple {26384#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,150 INFO L290 TraceCheckUtils]: 88: Hoare triple {26384#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:41,151 INFO L290 TraceCheckUtils]: 89: Hoare triple {26384#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,151 INFO L290 TraceCheckUtils]: 90: Hoare triple {26412#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,152 INFO L272 TraceCheckUtils]: 91: Hoare triple {26412#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,152 INFO L290 TraceCheckUtils]: 92: Hoare triple {26412#(<= ~counter~0 9)} ~cond := #in~cond; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,152 INFO L290 TraceCheckUtils]: 93: Hoare triple {26412#(<= ~counter~0 9)} assume !(0 == ~cond); {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,152 INFO L290 TraceCheckUtils]: 94: Hoare triple {26412#(<= ~counter~0 9)} assume true; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,153 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26412#(<= ~counter~0 9)} {26412#(<= ~counter~0 9)} #63#return; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,153 INFO L290 TraceCheckUtils]: 96: Hoare triple {26412#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,153 INFO L290 TraceCheckUtils]: 97: Hoare triple {26412#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:41,154 INFO L290 TraceCheckUtils]: 98: Hoare triple {26412#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,154 INFO L290 TraceCheckUtils]: 99: Hoare triple {26440#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,155 INFO L272 TraceCheckUtils]: 100: Hoare triple {26440#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,155 INFO L290 TraceCheckUtils]: 101: Hoare triple {26440#(<= ~counter~0 10)} ~cond := #in~cond; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,155 INFO L290 TraceCheckUtils]: 102: Hoare triple {26440#(<= ~counter~0 10)} assume !(0 == ~cond); {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,155 INFO L290 TraceCheckUtils]: 103: Hoare triple {26440#(<= ~counter~0 10)} assume true; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,156 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26440#(<= ~counter~0 10)} {26440#(<= ~counter~0 10)} #63#return; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,156 INFO L290 TraceCheckUtils]: 105: Hoare triple {26440#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,157 INFO L290 TraceCheckUtils]: 106: Hoare triple {26440#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:41,157 INFO L290 TraceCheckUtils]: 107: Hoare triple {26440#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,157 INFO L290 TraceCheckUtils]: 108: Hoare triple {26468#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,158 INFO L272 TraceCheckUtils]: 109: Hoare triple {26468#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,158 INFO L290 TraceCheckUtils]: 110: Hoare triple {26468#(<= ~counter~0 11)} ~cond := #in~cond; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,158 INFO L290 TraceCheckUtils]: 111: Hoare triple {26468#(<= ~counter~0 11)} assume !(0 == ~cond); {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,159 INFO L290 TraceCheckUtils]: 112: Hoare triple {26468#(<= ~counter~0 11)} assume true; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,159 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {26468#(<= ~counter~0 11)} {26468#(<= ~counter~0 11)} #63#return; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,159 INFO L290 TraceCheckUtils]: 114: Hoare triple {26468#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,160 INFO L290 TraceCheckUtils]: 115: Hoare triple {26468#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:41,160 INFO L290 TraceCheckUtils]: 116: Hoare triple {26468#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,160 INFO L290 TraceCheckUtils]: 117: Hoare triple {26496#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,161 INFO L272 TraceCheckUtils]: 118: Hoare triple {26496#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,161 INFO L290 TraceCheckUtils]: 119: Hoare triple {26496#(<= ~counter~0 12)} ~cond := #in~cond; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,161 INFO L290 TraceCheckUtils]: 120: Hoare triple {26496#(<= ~counter~0 12)} assume !(0 == ~cond); {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,162 INFO L290 TraceCheckUtils]: 121: Hoare triple {26496#(<= ~counter~0 12)} assume true; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,162 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26496#(<= ~counter~0 12)} {26496#(<= ~counter~0 12)} #63#return; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,162 INFO L290 TraceCheckUtils]: 123: Hoare triple {26496#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,163 INFO L290 TraceCheckUtils]: 124: Hoare triple {26496#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:41,163 INFO L290 TraceCheckUtils]: 125: Hoare triple {26496#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,163 INFO L290 TraceCheckUtils]: 126: Hoare triple {26524#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,164 INFO L272 TraceCheckUtils]: 127: Hoare triple {26524#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,164 INFO L290 TraceCheckUtils]: 128: Hoare triple {26524#(<= ~counter~0 13)} ~cond := #in~cond; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,165 INFO L290 TraceCheckUtils]: 129: Hoare triple {26524#(<= ~counter~0 13)} assume !(0 == ~cond); {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,165 INFO L290 TraceCheckUtils]: 130: Hoare triple {26524#(<= ~counter~0 13)} assume true; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,165 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {26524#(<= ~counter~0 13)} {26524#(<= ~counter~0 13)} #63#return; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,166 INFO L290 TraceCheckUtils]: 132: Hoare triple {26524#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,166 INFO L290 TraceCheckUtils]: 133: Hoare triple {26524#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:41,166 INFO L290 TraceCheckUtils]: 134: Hoare triple {26524#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,167 INFO L290 TraceCheckUtils]: 135: Hoare triple {26552#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,167 INFO L272 TraceCheckUtils]: 136: Hoare triple {26552#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,167 INFO L290 TraceCheckUtils]: 137: Hoare triple {26552#(<= ~counter~0 14)} ~cond := #in~cond; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,168 INFO L290 TraceCheckUtils]: 138: Hoare triple {26552#(<= ~counter~0 14)} assume !(0 == ~cond); {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,168 INFO L290 TraceCheckUtils]: 139: Hoare triple {26552#(<= ~counter~0 14)} assume true; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,169 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {26552#(<= ~counter~0 14)} {26552#(<= ~counter~0 14)} #63#return; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,169 INFO L290 TraceCheckUtils]: 141: Hoare triple {26552#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,169 INFO L290 TraceCheckUtils]: 142: Hoare triple {26552#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:41,170 INFO L290 TraceCheckUtils]: 143: Hoare triple {26552#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,170 INFO L290 TraceCheckUtils]: 144: Hoare triple {26580#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,170 INFO L272 TraceCheckUtils]: 145: Hoare triple {26580#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,171 INFO L290 TraceCheckUtils]: 146: Hoare triple {26580#(<= ~counter~0 15)} ~cond := #in~cond; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,171 INFO L290 TraceCheckUtils]: 147: Hoare triple {26580#(<= ~counter~0 15)} assume !(0 == ~cond); {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,187 INFO L290 TraceCheckUtils]: 148: Hoare triple {26580#(<= ~counter~0 15)} assume true; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,188 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {26580#(<= ~counter~0 15)} {26580#(<= ~counter~0 15)} #63#return; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,189 INFO L290 TraceCheckUtils]: 150: Hoare triple {26580#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,189 INFO L290 TraceCheckUtils]: 151: Hoare triple {26580#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:41,190 INFO L290 TraceCheckUtils]: 152: Hoare triple {26580#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,191 INFO L290 TraceCheckUtils]: 153: Hoare triple {26608#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,192 INFO L272 TraceCheckUtils]: 154: Hoare triple {26608#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,192 INFO L290 TraceCheckUtils]: 155: Hoare triple {26608#(<= ~counter~0 16)} ~cond := #in~cond; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,193 INFO L290 TraceCheckUtils]: 156: Hoare triple {26608#(<= ~counter~0 16)} assume !(0 == ~cond); {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,193 INFO L290 TraceCheckUtils]: 157: Hoare triple {26608#(<= ~counter~0 16)} assume true; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,195 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {26608#(<= ~counter~0 16)} {26608#(<= ~counter~0 16)} #63#return; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,195 INFO L290 TraceCheckUtils]: 159: Hoare triple {26608#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,196 INFO L290 TraceCheckUtils]: 160: Hoare triple {26608#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:41,196 INFO L290 TraceCheckUtils]: 161: Hoare triple {26608#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,197 INFO L290 TraceCheckUtils]: 162: Hoare triple {26636#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,198 INFO L272 TraceCheckUtils]: 163: Hoare triple {26636#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,198 INFO L290 TraceCheckUtils]: 164: Hoare triple {26636#(<= ~counter~0 17)} ~cond := #in~cond; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,199 INFO L290 TraceCheckUtils]: 165: Hoare triple {26636#(<= ~counter~0 17)} assume !(0 == ~cond); {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,199 INFO L290 TraceCheckUtils]: 166: Hoare triple {26636#(<= ~counter~0 17)} assume true; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,201 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {26636#(<= ~counter~0 17)} {26636#(<= ~counter~0 17)} #63#return; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,201 INFO L290 TraceCheckUtils]: 168: Hoare triple {26636#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,202 INFO L290 TraceCheckUtils]: 169: Hoare triple {26636#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:41,202 INFO L290 TraceCheckUtils]: 170: Hoare triple {26636#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,203 INFO L290 TraceCheckUtils]: 171: Hoare triple {26664#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,204 INFO L272 TraceCheckUtils]: 172: Hoare triple {26664#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,205 INFO L290 TraceCheckUtils]: 173: Hoare triple {26664#(<= ~counter~0 18)} ~cond := #in~cond; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,205 INFO L290 TraceCheckUtils]: 174: Hoare triple {26664#(<= ~counter~0 18)} assume !(0 == ~cond); {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,206 INFO L290 TraceCheckUtils]: 175: Hoare triple {26664#(<= ~counter~0 18)} assume true; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,207 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {26664#(<= ~counter~0 18)} {26664#(<= ~counter~0 18)} #63#return; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,207 INFO L290 TraceCheckUtils]: 177: Hoare triple {26664#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,208 INFO L290 TraceCheckUtils]: 178: Hoare triple {26664#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:41,208 INFO L290 TraceCheckUtils]: 179: Hoare triple {26664#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,209 INFO L290 TraceCheckUtils]: 180: Hoare triple {26692#(<= ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,209 INFO L272 TraceCheckUtils]: 181: Hoare triple {26692#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,210 INFO L290 TraceCheckUtils]: 182: Hoare triple {26692#(<= ~counter~0 19)} ~cond := #in~cond; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,210 INFO L290 TraceCheckUtils]: 183: Hoare triple {26692#(<= ~counter~0 19)} assume !(0 == ~cond); {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,210 INFO L290 TraceCheckUtils]: 184: Hoare triple {26692#(<= ~counter~0 19)} assume true; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,211 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26692#(<= ~counter~0 19)} {26692#(<= ~counter~0 19)} #63#return; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,211 INFO L290 TraceCheckUtils]: 186: Hoare triple {26692#(<= ~counter~0 19)} assume !!(0 != ~y3~0); {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,212 INFO L290 TraceCheckUtils]: 187: Hoare triple {26692#(<= ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:41,212 INFO L290 TraceCheckUtils]: 188: Hoare triple {26692#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26720#(<= |main_#t~post6| 19)} is VALID [2022-04-28 13:57:41,213 INFO L290 TraceCheckUtils]: 189: Hoare triple {26720#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {26132#false} is VALID [2022-04-28 13:57:41,213 INFO L272 TraceCheckUtils]: 190: Hoare triple {26132#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {26132#false} is VALID [2022-04-28 13:57:41,213 INFO L290 TraceCheckUtils]: 191: Hoare triple {26132#false} ~cond := #in~cond; {26132#false} is VALID [2022-04-28 13:57:41,213 INFO L290 TraceCheckUtils]: 192: Hoare triple {26132#false} assume 0 == ~cond; {26132#false} is VALID [2022-04-28 13:57:41,213 INFO L290 TraceCheckUtils]: 193: Hoare triple {26132#false} assume !false; {26132#false} is VALID [2022-04-28 13:57:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 38 proven. 1577 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:41,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:42,032 INFO L290 TraceCheckUtils]: 193: Hoare triple {26132#false} assume !false; {26132#false} is VALID [2022-04-28 13:57:42,032 INFO L290 TraceCheckUtils]: 192: Hoare triple {26132#false} assume 0 == ~cond; {26132#false} is VALID [2022-04-28 13:57:42,032 INFO L290 TraceCheckUtils]: 191: Hoare triple {26132#false} ~cond := #in~cond; {26132#false} is VALID [2022-04-28 13:57:42,032 INFO L272 TraceCheckUtils]: 190: Hoare triple {26132#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {26132#false} is VALID [2022-04-28 13:57:42,033 INFO L290 TraceCheckUtils]: 189: Hoare triple {26720#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {26132#false} is VALID [2022-04-28 13:57:42,033 INFO L290 TraceCheckUtils]: 188: Hoare triple {26692#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26720#(<= |main_#t~post6| 19)} is VALID [2022-04-28 13:57:42,033 INFO L290 TraceCheckUtils]: 187: Hoare triple {26692#(<= ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:42,033 INFO L290 TraceCheckUtils]: 186: Hoare triple {26692#(<= ~counter~0 19)} assume !!(0 != ~y3~0); {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:42,034 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26131#true} {26692#(<= ~counter~0 19)} #63#return; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:42,034 INFO L290 TraceCheckUtils]: 184: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,034 INFO L290 TraceCheckUtils]: 183: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,034 INFO L290 TraceCheckUtils]: 182: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,034 INFO L272 TraceCheckUtils]: 181: Hoare triple {26692#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,035 INFO L290 TraceCheckUtils]: 180: Hoare triple {26692#(<= ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:42,035 INFO L290 TraceCheckUtils]: 179: Hoare triple {26664#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26692#(<= ~counter~0 19)} is VALID [2022-04-28 13:57:42,036 INFO L290 TraceCheckUtils]: 178: Hoare triple {26664#(<= ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:42,036 INFO L290 TraceCheckUtils]: 177: Hoare triple {26664#(<= ~counter~0 18)} assume !!(0 != ~y3~0); {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:42,037 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {26131#true} {26664#(<= ~counter~0 18)} #63#return; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:42,037 INFO L290 TraceCheckUtils]: 175: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,037 INFO L290 TraceCheckUtils]: 174: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,037 INFO L290 TraceCheckUtils]: 173: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,037 INFO L272 TraceCheckUtils]: 172: Hoare triple {26664#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,037 INFO L290 TraceCheckUtils]: 171: Hoare triple {26664#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:42,038 INFO L290 TraceCheckUtils]: 170: Hoare triple {26636#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26664#(<= ~counter~0 18)} is VALID [2022-04-28 13:57:42,038 INFO L290 TraceCheckUtils]: 169: Hoare triple {26636#(<= ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:42,038 INFO L290 TraceCheckUtils]: 168: Hoare triple {26636#(<= ~counter~0 17)} assume !!(0 != ~y3~0); {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:42,039 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {26131#true} {26636#(<= ~counter~0 17)} #63#return; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:42,039 INFO L290 TraceCheckUtils]: 166: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,039 INFO L290 TraceCheckUtils]: 165: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,039 INFO L290 TraceCheckUtils]: 164: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,039 INFO L272 TraceCheckUtils]: 163: Hoare triple {26636#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,039 INFO L290 TraceCheckUtils]: 162: Hoare triple {26636#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:42,040 INFO L290 TraceCheckUtils]: 161: Hoare triple {26608#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26636#(<= ~counter~0 17)} is VALID [2022-04-28 13:57:42,040 INFO L290 TraceCheckUtils]: 160: Hoare triple {26608#(<= ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:42,040 INFO L290 TraceCheckUtils]: 159: Hoare triple {26608#(<= ~counter~0 16)} assume !!(0 != ~y3~0); {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:42,041 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {26131#true} {26608#(<= ~counter~0 16)} #63#return; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:42,041 INFO L290 TraceCheckUtils]: 157: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,041 INFO L290 TraceCheckUtils]: 156: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,041 INFO L290 TraceCheckUtils]: 155: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,041 INFO L272 TraceCheckUtils]: 154: Hoare triple {26608#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,041 INFO L290 TraceCheckUtils]: 153: Hoare triple {26608#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:42,042 INFO L290 TraceCheckUtils]: 152: Hoare triple {26580#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26608#(<= ~counter~0 16)} is VALID [2022-04-28 13:57:42,042 INFO L290 TraceCheckUtils]: 151: Hoare triple {26580#(<= ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:42,042 INFO L290 TraceCheckUtils]: 150: Hoare triple {26580#(<= ~counter~0 15)} assume !!(0 != ~y3~0); {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:42,043 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {26131#true} {26580#(<= ~counter~0 15)} #63#return; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:42,043 INFO L290 TraceCheckUtils]: 148: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,043 INFO L290 TraceCheckUtils]: 147: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,043 INFO L290 TraceCheckUtils]: 146: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,043 INFO L272 TraceCheckUtils]: 145: Hoare triple {26580#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,043 INFO L290 TraceCheckUtils]: 144: Hoare triple {26580#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:42,044 INFO L290 TraceCheckUtils]: 143: Hoare triple {26552#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26580#(<= ~counter~0 15)} is VALID [2022-04-28 13:57:42,044 INFO L290 TraceCheckUtils]: 142: Hoare triple {26552#(<= ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:42,044 INFO L290 TraceCheckUtils]: 141: Hoare triple {26552#(<= ~counter~0 14)} assume !!(0 != ~y3~0); {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:42,045 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {26131#true} {26552#(<= ~counter~0 14)} #63#return; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:42,045 INFO L290 TraceCheckUtils]: 139: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,045 INFO L290 TraceCheckUtils]: 138: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,045 INFO L290 TraceCheckUtils]: 137: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,045 INFO L272 TraceCheckUtils]: 136: Hoare triple {26552#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,045 INFO L290 TraceCheckUtils]: 135: Hoare triple {26552#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:42,046 INFO L290 TraceCheckUtils]: 134: Hoare triple {26524#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26552#(<= ~counter~0 14)} is VALID [2022-04-28 13:57:42,046 INFO L290 TraceCheckUtils]: 133: Hoare triple {26524#(<= ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:42,046 INFO L290 TraceCheckUtils]: 132: Hoare triple {26524#(<= ~counter~0 13)} assume !!(0 != ~y3~0); {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:42,047 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {26131#true} {26524#(<= ~counter~0 13)} #63#return; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:42,047 INFO L290 TraceCheckUtils]: 130: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,047 INFO L290 TraceCheckUtils]: 129: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,047 INFO L290 TraceCheckUtils]: 128: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,047 INFO L272 TraceCheckUtils]: 127: Hoare triple {26524#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,047 INFO L290 TraceCheckUtils]: 126: Hoare triple {26524#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:42,048 INFO L290 TraceCheckUtils]: 125: Hoare triple {26496#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26524#(<= ~counter~0 13)} is VALID [2022-04-28 13:57:42,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {26496#(<= ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:42,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {26496#(<= ~counter~0 12)} assume !!(0 != ~y3~0); {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:42,049 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26131#true} {26496#(<= ~counter~0 12)} #63#return; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:42,049 INFO L290 TraceCheckUtils]: 121: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,049 INFO L290 TraceCheckUtils]: 120: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,049 INFO L290 TraceCheckUtils]: 119: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,049 INFO L272 TraceCheckUtils]: 118: Hoare triple {26496#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,049 INFO L290 TraceCheckUtils]: 117: Hoare triple {26496#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:42,050 INFO L290 TraceCheckUtils]: 116: Hoare triple {26468#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26496#(<= ~counter~0 12)} is VALID [2022-04-28 13:57:42,050 INFO L290 TraceCheckUtils]: 115: Hoare triple {26468#(<= ~counter~0 11)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:42,050 INFO L290 TraceCheckUtils]: 114: Hoare triple {26468#(<= ~counter~0 11)} assume !!(0 != ~y3~0); {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:42,051 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {26131#true} {26468#(<= ~counter~0 11)} #63#return; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:42,051 INFO L290 TraceCheckUtils]: 112: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,051 INFO L290 TraceCheckUtils]: 111: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,051 INFO L290 TraceCheckUtils]: 110: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,051 INFO L272 TraceCheckUtils]: 109: Hoare triple {26468#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,051 INFO L290 TraceCheckUtils]: 108: Hoare triple {26468#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:42,052 INFO L290 TraceCheckUtils]: 107: Hoare triple {26440#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26468#(<= ~counter~0 11)} is VALID [2022-04-28 13:57:42,052 INFO L290 TraceCheckUtils]: 106: Hoare triple {26440#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:42,052 INFO L290 TraceCheckUtils]: 105: Hoare triple {26440#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:42,053 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26131#true} {26440#(<= ~counter~0 10)} #63#return; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:42,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,053 INFO L290 TraceCheckUtils]: 101: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,053 INFO L272 TraceCheckUtils]: 100: Hoare triple {26440#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {26440#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:42,054 INFO L290 TraceCheckUtils]: 98: Hoare triple {26412#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26440#(<= ~counter~0 10)} is VALID [2022-04-28 13:57:42,054 INFO L290 TraceCheckUtils]: 97: Hoare triple {26412#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:42,054 INFO L290 TraceCheckUtils]: 96: Hoare triple {26412#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:42,055 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26131#true} {26412#(<= ~counter~0 9)} #63#return; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:42,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,055 INFO L272 TraceCheckUtils]: 91: Hoare triple {26412#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {26412#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:42,056 INFO L290 TraceCheckUtils]: 89: Hoare triple {26384#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26412#(<= ~counter~0 9)} is VALID [2022-04-28 13:57:42,056 INFO L290 TraceCheckUtils]: 88: Hoare triple {26384#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:42,056 INFO L290 TraceCheckUtils]: 87: Hoare triple {26384#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:42,057 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26131#true} {26384#(<= ~counter~0 8)} #63#return; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:42,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,057 INFO L272 TraceCheckUtils]: 82: Hoare triple {26384#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {26384#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:42,058 INFO L290 TraceCheckUtils]: 80: Hoare triple {26356#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26384#(<= ~counter~0 8)} is VALID [2022-04-28 13:57:42,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {26356#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:42,058 INFO L290 TraceCheckUtils]: 78: Hoare triple {26356#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:42,059 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {26131#true} {26356#(<= ~counter~0 7)} #63#return; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:42,059 INFO L290 TraceCheckUtils]: 76: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,059 INFO L290 TraceCheckUtils]: 75: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,059 INFO L272 TraceCheckUtils]: 73: Hoare triple {26356#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {26356#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:42,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {26328#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26356#(<= ~counter~0 7)} is VALID [2022-04-28 13:57:42,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {26328#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:42,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {26328#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:42,061 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26131#true} {26328#(<= ~counter~0 6)} #63#return; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:42,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,061 INFO L272 TraceCheckUtils]: 64: Hoare triple {26328#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {26328#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:42,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {26300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26328#(<= ~counter~0 6)} is VALID [2022-04-28 13:57:42,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {26300#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:42,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {26300#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:42,063 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26131#true} {26300#(<= ~counter~0 5)} #63#return; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:42,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,063 INFO L272 TraceCheckUtils]: 55: Hoare triple {26300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {26300#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:42,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {26272#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26300#(<= ~counter~0 5)} is VALID [2022-04-28 13:57:42,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {26272#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:42,064 INFO L290 TraceCheckUtils]: 51: Hoare triple {26272#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:42,065 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26131#true} {26272#(<= ~counter~0 4)} #63#return; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:42,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,065 INFO L272 TraceCheckUtils]: 46: Hoare triple {26272#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {26272#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:42,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {26244#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26272#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:42,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {26244#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:42,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {26244#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:42,067 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {26131#true} {26244#(<= ~counter~0 3)} #63#return; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:42,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,067 INFO L272 TraceCheckUtils]: 37: Hoare triple {26244#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {26244#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:42,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {26216#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26244#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:42,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {26216#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:42,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {26216#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:42,069 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26131#true} {26216#(<= ~counter~0 2)} #63#return; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:42,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,069 INFO L272 TraceCheckUtils]: 28: Hoare triple {26216#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {26216#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:42,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {26188#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26216#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:42,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {26188#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:42,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {26188#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:42,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26131#true} {26188#(<= ~counter~0 1)} #63#return; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:42,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,071 INFO L272 TraceCheckUtils]: 19: Hoare triple {26188#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {26188#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:42,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {26139#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26188#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:42,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {26139#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,074 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26131#true} {26139#(<= ~counter~0 0)} #61#return; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L272 TraceCheckUtils]: 11: Hoare triple {26139#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26131#true} {26139#(<= ~counter~0 0)} #59#return; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {26131#true} assume true; {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {26131#true} assume !(0 == ~cond); {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {26131#true} ~cond := #in~cond; {26131#true} is VALID [2022-04-28 13:57:42,074 INFO L272 TraceCheckUtils]: 6: Hoare triple {26139#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {26131#true} is VALID [2022-04-28 13:57:42,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {26139#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {26139#(<= ~counter~0 0)} call #t~ret7 := main(); {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26139#(<= ~counter~0 0)} {26131#true} #67#return; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {26139#(<= ~counter~0 0)} assume true; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {26131#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26139#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:42,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {26131#true} call ULTIMATE.init(); {26131#true} is VALID [2022-04-28 13:57:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 38 proven. 893 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-28 13:57:42,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:42,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715441177] [2022-04-28 13:57:42,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:42,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45922675] [2022-04-28 13:57:42,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45922675] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:42,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:42,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-04-28 13:57:42,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:42,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [622395209] [2022-04-28 13:57:42,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [622395209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:42,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:42,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 13:57:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591112484] [2022-04-28 13:57:42,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 194 [2022-04-28 13:57:42,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:42,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 13:57:42,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:42,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 13:57:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 13:57:42,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-28 13:57:42,217 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 13:57:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:43,124 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2022-04-28 13:57:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 13:57:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 194 [2022-04-28 13:57:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 13:57:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 225 transitions. [2022-04-28 13:57:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 13:57:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 225 transitions. [2022-04-28 13:57:43,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 225 transitions. [2022-04-28 13:57:43,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:43,330 INFO L225 Difference]: With dead ends: 205 [2022-04-28 13:57:43,330 INFO L226 Difference]: Without dead ends: 200 [2022-04-28 13:57:43,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 13:57:43,332 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 82 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:43,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 13:57:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-28 13:57:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-28 13:57:43,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:43,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 13:57:43,621 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 13:57:43,621 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 13:57:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:43,626 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-28 13:57:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-28 13:57:43,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:43,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:43,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-28 13:57:43,627 INFO L87 Difference]: Start difference. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-28 13:57:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:43,633 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-28 13:57:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-28 13:57:43,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:43,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:43,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:43,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 13:57:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-28 13:57:43,639 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 194 [2022-04-28 13:57:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:43,640 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-28 13:57:43,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 13:57:43,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 221 transitions. [2022-04-28 13:57:43,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-28 13:57:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-28 13:57:43,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:43,935 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:43,962 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 13:57:44,135 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 13:57:44,136 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:44,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 39 times [2022-04-28 13:57:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:44,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736809407] [2022-04-28 13:57:44,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 40 times [2022-04-28 13:57:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:44,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930719300] [2022-04-28 13:57:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:44,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:44,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816574472] [2022-04-28 13:57:44,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:44,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:44,153 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 13:57:44,171 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 13:57:44,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:44,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 13:57:44,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 13:57:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 13:57:44,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 13:57:44,407 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 13:57:44,407 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 13:57:44,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 13:57:44,437 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 13:57:44,635 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 13:57:44,638 INFO L356 BasicCegarLoop]: Path program histogram: [40, 2, 2, 2, 2] [2022-04-28 13:57:44,641 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 13:57:44,666 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 13:57:44,666 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 13:57:44,666 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 13:57:44,667 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:57:44,668 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 13:57:44,669 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 13:57:44,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:57:44 BoogieIcfgContainer [2022-04-28 13:57:44,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 13:57:44,670 INFO L158 Benchmark]: Toolchain (without parser) took 60389.74ms. Allocated memory was 183.5MB in the beginning and 270.5MB in the end (delta: 87.0MB). Free memory was 127.8MB in the beginning and 227.3MB in the end (delta: -99.5MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. [2022-04-28 13:57:44,670 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 13:57:44,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.58ms. Allocated memory was 183.5MB in the beginning and 270.5MB in the end (delta: 87.0MB). Free memory was 127.7MB in the beginning and 241.7MB in the end (delta: -114.1MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-28 13:57:44,671 INFO L158 Benchmark]: Boogie Preprocessor took 46.56ms. Allocated memory is still 270.5MB. Free memory was 241.7MB in the beginning and 240.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 13:57:44,671 INFO L158 Benchmark]: RCFGBuilder took 246.94ms. Allocated memory is still 270.5MB. Free memory was 240.2MB in the beginning and 229.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 13:57:44,671 INFO L158 Benchmark]: TraceAbstraction took 59777.96ms. Allocated memory is still 270.5MB. Free memory was 228.6MB in the beginning and 227.3MB in the end (delta: 1.3MB). Peak memory consumption was 149.8MB. Max. memory is 8.0GB. [2022-04-28 13:57:44,672 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.14ms. Allocated memory is still 183.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.58ms. Allocated memory was 183.5MB in the beginning and 270.5MB in the end (delta: 87.0MB). Free memory was 127.7MB in the beginning and 241.7MB in the end (delta: -114.1MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.56ms. Allocated memory is still 270.5MB. Free memory was 241.7MB in the beginning and 240.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.94ms. Allocated memory is still 270.5MB. Free memory was 240.2MB in the beginning and 229.2MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 59777.96ms. Allocated memory is still 270.5MB. Free memory was 228.6MB in the beginning and 227.3MB in the end (delta: 1.3MB). Peak memory consumption was 149.8MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) [L30] CALL assume_abort_if_not(x2 != 0) [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.7s, OverallIterations: 24, TraceHistogramMax: 21, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 783 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 780 mSDsluCounter, 3288 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2502 mSDsCounter, 375 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1320 IncrementalHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 375 mSolverCounterUnsat, 786 mSDtfsCounter, 1320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4580 GetRequests, 4016 SyntacticMatches, 11 SemanticMatches, 553 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=23, InterpolantAutomatonStates: 476, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 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 13:57:44,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...