/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:59:04,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:59:04,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:59:04,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:59:04,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:59:04,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:59:04,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:59:04,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:59:04,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:59:04,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:59:04,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:59:04,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:59:04,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:59:04,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:59:04,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:59:04,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:59:04,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:59:04,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:59:04,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:59:04,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:59:04,978 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:59:04,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:59:04,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:59:04,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:59:04,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:59:04,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:59:04,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:59:04,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:59:04,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:59:04,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:59:04,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:59:04,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:59:04,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:59:04,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:59:04,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:59:05,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:59:05,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:59:05,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:59:05,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:59:05,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:59:05,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:59:05,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:59:05,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:59:05,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:59:05,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:59:05,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:59:05,010 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:59:05,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:59:05,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:59:05,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:59:05,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:59:05,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:59:05,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:59:05,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:59:05,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:59:05,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:59:05,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:59:05,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:59:05,013 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:59:05,013 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:59:05,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:59:05,013 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:59:05,013 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-08 07:59:05,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:59:05,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:59:05,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:59:05,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:59:05,209 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:59:05,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-08 07:59:05,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1016b94/0697d86301dd4ea8bd0077cc0735cfef/FLAG60644af8c [2022-04-08 07:59:05,546 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:59:05,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound20.c [2022-04-08 07:59:05,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1016b94/0697d86301dd4ea8bd0077cc0735cfef/FLAG60644af8c [2022-04-08 07:59:05,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1016b94/0697d86301dd4ea8bd0077cc0735cfef [2022-04-08 07:59:05,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:59:05,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:59:05,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:59:05,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:59:05,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:59:05,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:59:05" (1/1) ... [2022-04-08 07:59:05,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ec439d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:05, skipping insertion in model container [2022-04-08 07:59:05,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:59:05" (1/1) ... [2022-04-08 07:59:05,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:59:06,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:59:06,128 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/ps6-ll_unwindbound20.c[458,471] [2022-04-08 07:59:06,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:59:06,148 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:59:06,156 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/ps6-ll_unwindbound20.c[458,471] [2022-04-08 07:59:06,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:59:06,176 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:59:06,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06 WrapperNode [2022-04-08 07:59:06,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:59:06,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:59:06,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:59:06,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:59:06,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:59:06,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:59:06,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:59:06,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:59:06,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (1/1) ... [2022-04-08 07:59:06,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:59:06,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:06,230 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-08 07:59:06,239 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-08 07:59:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:59:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:59:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:59:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:59:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:59:06,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:59:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:59:06,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:59:06,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:59:06,306 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:59:06,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:59:06,412 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:59:06,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:59:06,417 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:59:06,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:59:06 BoogieIcfgContainer [2022-04-08 07:59:06,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:59:06,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:59:06,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:59:06,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:59:06,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:59:05" (1/3) ... [2022-04-08 07:59:06,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cda4b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:59:06, skipping insertion in model container [2022-04-08 07:59:06,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:59:06" (2/3) ... [2022-04-08 07:59:06,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cda4b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:59:06, skipping insertion in model container [2022-04-08 07:59:06,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:59:06" (3/3) ... [2022-04-08 07:59:06,434 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound20.c [2022-04-08 07:59:06,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:59:06,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:59:06,494 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:59:06,501 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 07:59:06,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:59:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-08 07:59:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:59:06,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:06,523 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:06,524 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 07:59:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:06,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057703809] [2022-04-08 07:59:06,550 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:59:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 07:59:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:06,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975485272] [2022-04-08 07:59:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:06,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:59:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:06,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-08 07:59:06,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:59:06,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 07:59:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:59:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:06,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:59:06,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:59:06,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:59:06,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:59:06,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:59:06,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-08 07:59:06,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:59:06,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 07:59:06,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 07:59:06,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-08 07:59:06,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 07:59:06,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:59:06,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:59:06,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:59:06,759 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:59:06,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 07:59:06,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 07:59:06,759 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-08 07:59:06,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 07:59:06,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 07:59:06,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 07:59:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:59:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:06,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975485272] [2022-04-08 07:59:06,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975485272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:06,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:06,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:59:06,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:06,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057703809] [2022-04-08 07:59:06,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057703809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:06,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:06,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:59:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643830619] [2022-04-08 07:59:06,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:06,773 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:59:06,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:06,776 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:06,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:06,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:59:06,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:59:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:59:06,828 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:07,157 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 07:59:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:59:07,157 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 07:59:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:07,158 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 07:59:07,165 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 07:59:07,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 07:59:07,225 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-08 07:59:07,231 INFO L225 Difference]: With dead ends: 50 [2022-04-08 07:59:07,231 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 07:59:07,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-08 07:59:07,235 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:07,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:59:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 07:59:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 07:59:07,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:07,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 07:59:07,257 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 07:59:07,258 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 07:59:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:07,261 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 07:59:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 07:59:07,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:07,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:07,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-08 07:59:07,270 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 25 states. [2022-04-08 07:59:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:07,273 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 07:59:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 07:59:07,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:07,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:07,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:07,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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-08 07:59:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 07:59:07,276 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 07:59:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:07,277 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 07:59:07,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:07,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 07:59:07,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:59:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 07:59:07,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:07,301 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:07,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:59:07,301 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 07:59:07,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:07,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4033515] [2022-04-08 07:59:07,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:59:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 07:59:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:07,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74733545] [2022-04-08 07:59:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:07,317 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:07,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416394635] [2022-04-08 07:59:07,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:07,319 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-08 07:59:07,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 07:59:07,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:59:07,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:07,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 07:59:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:07,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:07,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 07:59:07,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:07,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-08 07:59:07,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {243#false} is VALID [2022-04-08 07:59:07,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {243#false} is VALID [2022-04-08 07:59:07,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 07:59:07,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 07:59:07,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 07:59:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:59:07,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:59:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74733545] [2022-04-08 07:59:07,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416394635] [2022-04-08 07:59:07,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416394635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:07,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:07,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:59:07,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4033515] [2022-04-08 07:59:07,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4033515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:07,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:07,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:59:07,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574844461] [2022-04-08 07:59:07,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:07,507 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 07:59:07,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:07,508 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:59:07,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:07,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 07:59:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 07:59:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 07:59:07,522 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:59:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:07,609 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 07:59:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 07:59:07,609 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 07:59:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:07,610 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:59:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 07:59:07,611 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:59:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 07:59:07,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 07:59:07,645 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-08 07:59:07,647 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:59:07,647 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 07:59:07,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-08 07:59:07,650 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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-08 07:59:07,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 07:59:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 07:59:07,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:07,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08 07:59:07,683 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08 07:59:07,683 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08 07:59:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:07,684 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:59:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:59:07,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:07,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:07,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08 07:59:07,685 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08 07:59:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:07,687 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:59:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:59:07,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:07,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:07,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:07,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 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-08 07:59:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 07:59:07,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 07:59:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:07,689 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 07:59:07,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:59:07,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 07:59:07,716 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-08 07:59:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:59:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 07:59:07,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:07,724 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:07,743 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-08 07:59:07,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:07,940 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 07:59:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:07,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1549598865] [2022-04-08 07:59:07,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:59:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 07:59:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710938048] [2022-04-08 07:59:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:07,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243276570] [2022-04-08 07:59:07,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:07,958 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-08 07:59:07,959 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-08 07:59:07,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:59:07,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:07,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:59:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:07,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:08,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 07:59:08,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-08 07:59:08,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 07:59:08,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 07:59:08,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 07:59:08,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID [2022-04-08 07:59:08,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-08 07:59:08,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 07:59:08,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 07:59:08,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 07:59:08,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 07:59:08,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:08,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:08,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:08,082 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:08,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:08,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 07:59:08,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 07:59:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:59:08,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:59:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710938048] [2022-04-08 07:59:08,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243276570] [2022-04-08 07:59:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243276570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:59:08,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1549598865] [2022-04-08 07:59:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1549598865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:59:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709740920] [2022-04-08 07:59:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:08,087 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 07:59:08,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:08,087 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:08,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:08,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:59:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:08,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:59:08,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:59:08,101 INFO L87 Difference]: Start difference. First operand 26 states and 29 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:08,251 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 07:59:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:59:08,252 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 07:59:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:08,252 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 07:59:08,253 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 07:59:08,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 07:59:08,286 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-08 07:59:08,287 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:59:08,287 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 07:59:08,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-08 07:59:08,288 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:08,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 07:59:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 07:59:08,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:08,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 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-08 07:59:08,302 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 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-08 07:59:08,303 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 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-08 07:59:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:08,304 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 07:59:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:59:08,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:08,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:08,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 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 32 states. [2022-04-08 07:59:08,305 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 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 32 states. [2022-04-08 07:59:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:08,306 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 07:59:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:59:08,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:08,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:08,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:08,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 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-08 07:59:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 07:59:08,308 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 07:59:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:08,308 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 07:59:08,309 INFO L479 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 07:59:08,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 07:59:08,341 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-08 07:59:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:59:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 07:59:08,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:08,342 INFO L499 BasicCegarLoop]: trace histogram [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-08 07:59:08,361 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-08 07:59:08,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 07:59:08,560 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:08,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 07:59:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:08,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876273758] [2022-04-08 07:59:08,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:08,737 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:08,737 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 07:59:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344377995] [2022-04-08 07:59:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:08,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:08,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868842330] [2022-04-08 07:59:08,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:08,750 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-08 07:59:08,751 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-08 07:59:08,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:08,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:08,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:59:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:08,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:09,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 07:59:09,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:09,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,112 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,113 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:09,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-08 07:59:09,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-08 07:59:09,115 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-08 07:59:09,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 07:59:09,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 07:59:09,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 07:59:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:59:09,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:09,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 07:59:09,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 07:59:09,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 07:59:09,251 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-08 07:59:09,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {732#false} is VALID [2022-04-08 07:59:09,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:09,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 20)} is VALID [2022-04-08 07:59:09,253 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 20)} #55#return; {830#(< ~counter~0 20)} is VALID [2022-04-08 07:59:09,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 07:59:09,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 07:59:09,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 07:59:09,254 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {731#true} is VALID [2022-04-08 07:59:09,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-08 07:59:09,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 20)} is VALID [2022-04-08 07:59:09,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 19)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 19)} #53#return; {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 07:59:09,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 07:59:09,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 07:59:09,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 19)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 07:59:09,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 19)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 19)} call #t~ret6 := main(); {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 19)} {731#true} #61#return; {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 19)} assume true; {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 19)} is VALID [2022-04-08 07:59:09,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 07:59:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:59:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344377995] [2022-04-08 07:59:09,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868842330] [2022-04-08 07:59:09,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868842330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:09,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:09,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 07:59:09,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:09,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876273758] [2022-04-08 07:59:09,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876273758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:09,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:09,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:59:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810314426] [2022-04-08 07:59:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 07:59:09,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:09,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:59:09,280 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-08 07:59:09,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:59:09,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:09,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:59:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:59:09,281 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:59:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:09,393 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 07:59:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 07:59:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 07:59:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:59:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 07:59:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:59:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 07:59:09,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 07:59:09,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:09,434 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:59:09,434 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 07:59:09,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 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-08 07:59:09,436 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:09,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 07:59:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 07:59:09,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:09,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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-08 07:59:09,455 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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-08 07:59:09,456 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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-08 07:59:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:09,459 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 07:59:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 07:59:09,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:09,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:09,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 34 states. [2022-04-08 07:59:09,464 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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 34 states. [2022-04-08 07:59:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:09,468 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 07:59:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 07:59:09,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:09,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:09,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:09,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 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-08 07:59:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 07:59:09,472 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 07:59:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:09,472 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 07:59:09,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:59:09,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 07:59:09,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 07:59:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 07:59:09,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:09,505 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:09,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 07:59:09,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:09,706 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 07:59:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:09,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626918390] [2022-04-08 07:59:09,837 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:09,837 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:09,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:09,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 07:59:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187879942] [2022-04-08 07:59:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:09,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:09,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248333578] [2022-04-08 07:59:09,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:09,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:09,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:09,849 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-08 07:59:09,850 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-08 07:59:09,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:09,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:09,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:59:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:09,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:09,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 07:59:10,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-08 07:59:10,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:59:10,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 07:59:10,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 07:59:10,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-08 07:59:10,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:59:10,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:59:10,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:59:10,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:59:10,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 07:59:10,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:10,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:10,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:10,014 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:59:10,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:59:10,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:59:10,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:59:10,014 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:10,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 07:59:10,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 07:59:10,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-08 07:59:10,016 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:10,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:10,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 07:59:10,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 07:59:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:59:10,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:10,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 07:59:10,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 07:59:10,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:10,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:10,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,198 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:59:10,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:59:10,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:59:10,199 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:59:10,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 07:59:10,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 07:59:10,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 07:59:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 07:59:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:10,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187879942] [2022-04-08 07:59:10,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:10,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248333578] [2022-04-08 07:59:10,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248333578] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:10,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:10,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:59:10,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:10,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1626918390] [2022-04-08 07:59:10,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1626918390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:10,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:10,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:59:10,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252136478] [2022-04-08 07:59:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:10,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-08 07:59:10,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:10,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:59:10,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:10,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:59:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:59:10,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:59:10,264 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:59:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:10,377 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 07:59:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:59:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-08 07:59:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:59:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:59:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:59:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:59:10,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 07:59:10,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:10,481 INFO L225 Difference]: With dead ends: 40 [2022-04-08 07:59:10,481 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 07:59:10,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:59:10,482 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:10,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 07:59:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 07:59:10,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:10,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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-08 07:59:10,502 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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-08 07:59:10,503 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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-08 07:59:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:10,504 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 07:59:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 07:59:10,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:10,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:10,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 36 states. [2022-04-08 07:59:10,504 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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 36 states. [2022-04-08 07:59:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:10,505 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 07:59:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 07:59:10,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:10,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:10,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:10,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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-08 07:59:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 07:59:10,507 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 07:59:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:10,507 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 07:59:10,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:59:10,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 07:59:10,629 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-08 07:59:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 07:59:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:59:10,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:10,630 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:10,649 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-08 07:59:10,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:10,830 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 07:59:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:10,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372852193] [2022-04-08 07:59:10,935 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:10,935 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:10,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 07:59:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:10,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466738517] [2022-04-08 07:59:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:10,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:10,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008205884] [2022-04-08 07:59:10,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:10,953 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-08 07:59:10,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-08 07:59:10,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:10,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:10,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:59:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:11,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:11,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:59:11,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 07:59:11,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:11,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:11,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:11,259 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 07:59:11,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:59:11,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:59:11,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:59:11,260 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:11,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:59:11,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:59:11,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:59:11,261 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 07:59:11,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:59:11,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:59:11,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:59:11,262 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:59:11,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:11,262 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-08 07:59:11,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 07:59:11,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 07:59:11,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 07:59:11,263 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:11,263 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:11,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:11,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 07:59:11,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 07:59:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:59:11,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:11,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466738517] [2022-04-08 07:59:11,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:11,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008205884] [2022-04-08 07:59:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008205884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:11,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:59:11,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:11,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372852193] [2022-04-08 07:59:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372852193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:11,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:59:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059975538] [2022-04-08 07:59:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:11,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:59:11,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:11,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:59:11,533 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-08 07:59:11,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:59:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:59:11,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:59:11,534 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:59:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:11,713 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 07:59:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:59:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-08 07:59:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:59:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 07:59:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:59:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 07:59:11,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 07:59:11,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:11,749 INFO L225 Difference]: With dead ends: 44 [2022-04-08 07:59:11,749 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 07:59:11,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:59:11,750 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:11,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 07:59:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 07:59:11,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:11,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:11,775 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:11,776 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:11,779 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 07:59:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 07:59:11,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:11,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:11,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-08 07:59:11,780 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-08 07:59:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:11,781 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 07:59:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 07:59:11,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:11,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:11,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:11,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 07:59:11,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 07:59:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:11,784 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 07:59:11,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:59:11,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 07:59:11,867 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-08 07:59:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 07:59:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 07:59:11,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:11,868 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:11,900 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-08 07:59:12,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:12,068 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 07:59:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285602135] [2022-04-08 07:59:12,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:12,178 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:12,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 07:59:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:12,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387101635] [2022-04-08 07:59:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:12,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:12,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:12,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527898482] [2022-04-08 07:59:12,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:12,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:12,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:12,213 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-08 07:59:12,214 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-08 07:59:12,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:12,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:12,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 07:59:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:12,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:12,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 07:59:12,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,423 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,424 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:12,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,425 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,426 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:12,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,428 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,429 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:12,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 07:59:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:12,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:12,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 07:59:12,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 07:59:12,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 07:59:12,642 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-08 07:59:12,642 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 07:59:12,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:59:12,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:59:12,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:59:12,642 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 07:59:12,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1926#false} is VALID [2022-04-08 07:59:12,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:12,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 20)} is VALID [2022-04-08 07:59:12,644 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 20)} #55#return; {2079#(< ~counter~0 20)} is VALID [2022-04-08 07:59:12,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:59:12,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:59:12,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:59:12,644 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 07:59:12,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-08 07:59:12,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 20)} is VALID [2022-04-08 07:59:12,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 19)} is VALID [2022-04-08 07:59:12,646 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 19)} #55#return; {2104#(< ~counter~0 19)} is VALID [2022-04-08 07:59:12,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:59:12,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:59:12,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:59:12,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-08 07:59:12,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-08 07:59:12,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 19)} is VALID [2022-04-08 07:59:12,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 18)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 18)} #53#return; {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 07:59:12,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 07:59:12,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 07:59:12,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 18)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 07:59:12,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 18)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 18)} call #t~ret6 := main(); {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 18)} {1925#true} #61#return; {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 18)} assume true; {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 18)} is VALID [2022-04-08 07:59:12,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 07:59:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:59:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:12,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387101635] [2022-04-08 07:59:12,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:12,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527898482] [2022-04-08 07:59:12,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527898482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:12,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:12,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 07:59:12,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:12,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285602135] [2022-04-08 07:59:12,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285602135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:12,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:12,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:59:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501695289] [2022-04-08 07:59:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:12,651 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-08 07:59:12,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:12,651 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:59:12,679 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-08 07:59:12,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 07:59:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 07:59:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:59:12,680 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:59:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:12,813 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 07:59:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:59:12,813 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-08 07:59:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:12,813 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:59:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 07:59:12,814 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:59:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 07:59:12,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 07:59:12,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:12,857 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:59:12,857 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 07:59:12,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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-08 07:59:12,858 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:12,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 07:59:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 07:59:12,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:12,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-08 07:59:12,891 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-08 07:59:12,891 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-08 07:59:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:12,892 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:59:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:59:12,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:12,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:12,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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 44 states. [2022-04-08 07:59:12,892 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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 44 states. [2022-04-08 07:59:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:12,893 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:59:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:59:12,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:12,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:12,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:12,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-08 07:59:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 07:59:12,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 07:59:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:12,895 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 07:59:12,895 INFO L479 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), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:59:12,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 07:59:13,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 07:59:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 07:59:13,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:13,055 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:13,074 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-08 07:59:13,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:13,255 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 07:59:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907493453] [2022-04-08 07:59:13,348 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:13,348 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:13,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 07:59:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:13,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761960065] [2022-04-08 07:59:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:13,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:13,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583020659] [2022-04-08 07:59:13,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:59:13,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:13,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:13,374 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-08 07:59:13,375 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-08 07:59:13,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:59:13,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:13,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 07:59:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:13,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:13,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:59:13,704 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 07:59:13,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:13,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:13,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:13,706 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:59:13,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:59:13,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:59:13,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:59:13,706 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:13,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:59:13,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:59:13,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:59:13,708 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:59:13,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:59:13,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:59:13,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:59:13,709 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:59:13,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:59:13,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:59:13,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:59:13,710 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:59:13,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:59:13,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:59:13,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:59:13,711 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:59:13,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:59:13,712 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-08 07:59:13,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 07:59:13,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 07:59:13,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 07:59:13,712 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:59:13,713 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:13,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:13,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 07:59:13,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 07:59:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 07:59:13,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:13,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761960065] [2022-04-08 07:59:13,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:13,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583020659] [2022-04-08 07:59:13,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583020659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:13,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:13,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:59:13,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907493453] [2022-04-08 07:59:13,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907493453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:13,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:13,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:59:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431428404] [2022-04-08 07:59:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-08 07:59:13,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:13,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:59:14,010 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-08 07:59:14,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:59:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:59:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 07:59:14,011 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:59:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:14,322 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 07:59:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:59:14,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-08 07:59:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:59:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 07:59:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:59:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 07:59:14,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 07:59:14,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:14,365 INFO L225 Difference]: With dead ends: 52 [2022-04-08 07:59:14,365 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 07:59:14,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:59:14,366 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:14,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:59:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 07:59:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 07:59:14,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:14,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:14,408 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:14,409 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:14,411 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 07:59:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 07:59:14,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:14,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:14,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-08 07:59:14,411 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-08 07:59:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:14,412 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 07:59:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 07:59:14,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:14,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:14,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:14,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 07:59:14,419 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 07:59:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:14,420 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 07:59:14,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 07:59:14,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 07:59:14,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 07:59:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 07:59:14,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:14,513 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:14,530 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-08 07:59:14,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:14,719 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 07:59:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:14,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173186186] [2022-04-08 07:59:14,836 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:14,836 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:14,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 07:59:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228543808] [2022-04-08 07:59:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:14,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:14,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502277604] [2022-04-08 07:59:14,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:59:14,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:14,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:14,856 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-08 07:59:14,857 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-08 07:59:14,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:59:14,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:14,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:59:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:14,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:15,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 07:59:15,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:15,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,140 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,141 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:15,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,142 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,143 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:15,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,144 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,145 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:15,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-08 07:59:15,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-08 07:59:15,146 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 07:59:15,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 07:59:15,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 07:59:15,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 07:59:15,146 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 07:59:15,147 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 07:59:15,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 07:59:15,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 07:59:15,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 07:59:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:15,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:15,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 07:59:15,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 07:59:15,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 07:59:15,360 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 07:59:15,360 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 07:59:15,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:59:15,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:59:15,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:59:15,360 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 07:59:15,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2951#false} is VALID [2022-04-08 07:59:15,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:15,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 20)} is VALID [2022-04-08 07:59:15,367 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 20)} #55#return; {3129#(< ~counter~0 20)} is VALID [2022-04-08 07:59:15,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:59:15,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:59:15,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:59:15,368 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 07:59:15,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-08 07:59:15,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 20)} is VALID [2022-04-08 07:59:15,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 19)} is VALID [2022-04-08 07:59:15,369 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 19)} #55#return; {3154#(< ~counter~0 19)} is VALID [2022-04-08 07:59:15,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:59:15,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:59:15,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:59:15,369 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 07:59:15,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-08 07:59:15,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 19)} is VALID [2022-04-08 07:59:15,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 18)} is VALID [2022-04-08 07:59:15,371 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 18)} #55#return; {3179#(< ~counter~0 18)} is VALID [2022-04-08 07:59:15,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:59:15,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:59:15,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:59:15,371 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-08 07:59:15,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-08 07:59:15,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 18)} is VALID [2022-04-08 07:59:15,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 17)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 17)} #53#return; {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 07:59:15,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 07:59:15,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 07:59:15,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 17)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 07:59:15,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 17)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 17)} call #t~ret6 := main(); {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 17)} {2950#true} #61#return; {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 17)} assume true; {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 17)} is VALID [2022-04-08 07:59:15,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 07:59:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 07:59:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:15,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228543808] [2022-04-08 07:59:15,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502277604] [2022-04-08 07:59:15,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502277604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:15,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:15,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 07:59:15,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:15,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173186186] [2022-04-08 07:59:15,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173186186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:15,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:15,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:59:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516356661] [2022-04-08 07:59:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-08 07:59:15,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:15,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:15,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:15,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:59:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:15,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:59:15,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:59:15,409 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:15,554 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 07:59:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:59:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-08 07:59:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 07:59:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 07:59:15,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 07:59:15,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:15,597 INFO L225 Difference]: With dead ends: 62 [2022-04-08 07:59:15,597 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 07:59:15,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 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-08 07:59:15,599 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:15,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 07:59:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 07:59:15,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:15,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-08 07:59:15,646 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-08 07:59:15,647 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-08 07:59:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:15,648 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 07:59:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 07:59:15,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:15,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:15,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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 52 states. [2022-04-08 07:59:15,649 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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 52 states. [2022-04-08 07:59:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:15,650 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 07:59:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 07:59:15,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:15,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:15,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:15,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-08 07:59:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 07:59:15,651 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 07:59:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:15,651 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 07:59:15,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:59:15,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 07:59:15,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 07:59:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 07:59:15,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:15,748 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:15,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 07:59:15,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 07:59:15,949 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 07:59:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:15,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127725368] [2022-04-08 07:59:16,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:16,046 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:16,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 07:59:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:16,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819122352] [2022-04-08 07:59:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:16,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:16,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290732267] [2022-04-08 07:59:16,058 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:59:16,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:16,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:16,059 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-08 07:59:16,061 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-08 07:59:22,670 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:59:22,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:22,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:59:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:22,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:23,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 07:59:23,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-08 07:59:23,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 07:59:23,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:23,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:23,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:23,015 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:59:23,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:59:23,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:59:23,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,016 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:23,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:23,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:23,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:23,017 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:59:23,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:59:23,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:59:23,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,018 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:23,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:23,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:23,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:23,019 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:59:23,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:59:23,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:59:23,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,020 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:23,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:59:23,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:59:23,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:59:23,021 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:59:23,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:59:23,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:59:23,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,037 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:59:23,038 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:59:23,038 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-08 07:59:23,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 07:59:23,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 07:59:23,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 07:59:23,039 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:59:23,040 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:23,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:23,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 07:59:23,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 07:59:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 07:59:23,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819122352] [2022-04-08 07:59:23,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290732267] [2022-04-08 07:59:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290732267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:23,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:59:23,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:23,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127725368] [2022-04-08 07:59:23,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127725368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:23,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:23,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:59:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612564972] [2022-04-08 07:59:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:23,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-08 07:59:23,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:23,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:59:23,335 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-08 07:59:23,335 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:59:23,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:59:23,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:59:23,336 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:59:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:23,723 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 07:59:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:59:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-08 07:59:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:59:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 07:59:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:59:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 07:59:23,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 07:59:23,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:23,775 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:59:23,775 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 07:59:23,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:59:23,776 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:23,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:59:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 07:59:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 07:59:23,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:23,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:23,829 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:23,830 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:23,831 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 07:59:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 07:59:23,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:23,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:23,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 07:59:23,832 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 07:59:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:23,833 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 07:59:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 07:59:23,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:23,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:23,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:23,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 07:59:23,834 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 07:59:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:23,834 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 07:59:23,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 07:59:23,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 07:59:23,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 07:59:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 07:59:23,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:23,973 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:23,979 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-08 07:59:24,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 07:59:24,174 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 07:59:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:24,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169679098] [2022-04-08 07:59:24,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:24,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:24,283 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 07:59:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:24,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558126125] [2022-04-08 07:59:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:24,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:24,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:24,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270732532] [2022-04-08 07:59:24,310 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:59:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:24,313 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-08 07:59:24,332 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-08 07:59:24,701 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 07:59:24,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:24,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 07:59:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:24,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:24,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 07:59:24,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:24,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,962 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,963 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:24,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,964 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,966 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:24,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,967 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,968 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:24,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,973 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,974 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:24,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 07:59:24,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 07:59:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:24,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:25,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 07:59:25,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 07:59:25,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 07:59:25,235 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 07:59:25,235 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 07:59:25,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 07:59:25,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 07:59:25,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 07:59:25,236 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 07:59:25,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4149#false} is VALID [2022-04-08 07:59:25,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:25,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 20)} is VALID [2022-04-08 07:59:25,238 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 20)} #55#return; {4352#(< ~counter~0 20)} is VALID [2022-04-08 07:59:25,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 07:59:25,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 07:59:25,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 07:59:25,238 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 07:59:25,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-08 07:59:25,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 20)} is VALID [2022-04-08 07:59:25,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 19)} is VALID [2022-04-08 07:59:25,239 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 19)} #55#return; {4377#(< ~counter~0 19)} is VALID [2022-04-08 07:59:25,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 07:59:25,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 07:59:25,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 07:59:25,240 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 07:59:25,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-08 07:59:25,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 19)} is VALID [2022-04-08 07:59:25,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 18)} is VALID [2022-04-08 07:59:25,241 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 18)} #55#return; {4402#(< ~counter~0 18)} is VALID [2022-04-08 07:59:25,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 07:59:25,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 07:59:25,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 07:59:25,241 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 07:59:25,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-08 07:59:25,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 18)} is VALID [2022-04-08 07:59:25,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 17)} is VALID [2022-04-08 07:59:25,242 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 17)} #55#return; {4427#(< ~counter~0 17)} is VALID [2022-04-08 07:59:25,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 07:59:25,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 07:59:25,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 07:59:25,243 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-08 07:59:25,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-08 07:59:25,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 17)} is VALID [2022-04-08 07:59:25,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 16)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 16)} #53#return; {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 07:59:25,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 07:59:25,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 07:59:25,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 16)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-08 07:59:25,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 16)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 16)} call #t~ret6 := main(); {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 16)} {4148#true} #61#return; {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 16)} assume true; {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 16)} is VALID [2022-04-08 07:59:25,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 07:59:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 07:59:25,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:25,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558126125] [2022-04-08 07:59:25,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:25,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270732532] [2022-04-08 07:59:25,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270732532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:25,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:25,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 07:59:25,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:25,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169679098] [2022-04-08 07:59:25,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169679098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:25,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:25,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:59:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908839615] [2022-04-08 07:59:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-08 07:59:25,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:25,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:25,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:25,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:59:25,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:25,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:59:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:59:25,288 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:25,466 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-08 07:59:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:59:25,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-08 07:59:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 07:59:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 07:59:25,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-08 07:59:25,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:25,523 INFO L225 Difference]: With dead ends: 70 [2022-04-08 07:59:25,523 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 07:59:25,524 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 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-08 07:59:25,524 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:25,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 07:59:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 07:59:25,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:25,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-08 07:59:25,576 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-08 07:59:25,576 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-08 07:59:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:25,577 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 07:59:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 07:59:25,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:25,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:25,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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 60 states. [2022-04-08 07:59:25,578 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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 60 states. [2022-04-08 07:59:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:25,579 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 07:59:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 07:59:25,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:25,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:25,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:25,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-08 07:59:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 07:59:25,580 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-08 07:59:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:25,580 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 07:59:25,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:59:25,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 07:59:25,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 07:59:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 07:59:25,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:25,733 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:25,738 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-08 07:59:25,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 07:59:25,938 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-08 07:59:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:25,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79613296] [2022-04-08 07:59:26,036 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:26,036 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:26,036 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-08 07:59:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:26,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244785501] [2022-04-08 07:59:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:26,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:26,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154683018] [2022-04-08 07:59:26,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:26,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:26,050 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-08 07:59:26,051 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-08 07:59:26,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:26,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:26,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 07:59:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:26,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:27,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 07:59:27,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:27,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:27,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:27,008 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,009 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:27,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:59:27,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:59:27,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:59:27,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,011 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:59:27,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,012 INFO L272 TraceCheckUtils]: 30: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,013 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,014 INFO L272 TraceCheckUtils]: 38: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,014 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4879#true} {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 07:59:27,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:59:27,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:59:27,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:59:27,015 INFO L272 TraceCheckUtils]: 46: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,016 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:59:27,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:59:27,017 INFO L272 TraceCheckUtils]: 52: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-08 07:59:27,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 07:59:27,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 07:59:27,017 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 07:59:27,017 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:59:27,018 INFO L272 TraceCheckUtils]: 57: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:27,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:27,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 07:59:27,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 07:59:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 07:59:27,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244785501] [2022-04-08 07:59:27,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154683018] [2022-04-08 07:59:27,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154683018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:27,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:27,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:59:27,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:27,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79613296] [2022-04-08 07:59:27,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79613296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:27,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:27,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:59:27,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671584133] [2022-04-08 07:59:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:27,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-08 07:59:27,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:27,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:59:27,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:27,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:59:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:59:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:59:27,592 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:59:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:28,107 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-08 07:59:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:59:28,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-08 07:59:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:59:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 07:59:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:59:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 07:59:28,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-08 07:59:28,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:28,150 INFO L225 Difference]: With dead ends: 68 [2022-04-08 07:59:28,151 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 07:59:28,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:59:28,151 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:28,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:59:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 07:59:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 07:59:28,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:28,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:28,208 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:28,208 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:28,209 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 07:59:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 07:59:28,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:28,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:28,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-08 07:59:28,210 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-08 07:59:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:28,211 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 07:59:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 07:59:28,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:28,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:28,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:28,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-08 07:59:28,212 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-08 07:59:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:28,212 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-08 07:59:28,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 07:59:28,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-08 07:59:28,394 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-08 07:59:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 07:59:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 07:59:28,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:28,395 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:28,402 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-08 07:59:28,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 07:59:28,600 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-08 07:59:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:28,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607378546] [2022-04-08 07:59:28,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:28,692 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:28,692 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-08 07:59:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:28,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053104320] [2022-04-08 07:59:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:28,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:28,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703566492] [2022-04-08 07:59:28,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:28,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:28,702 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-08 07:59:28,703 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-08 07:59:28,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:28,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:28,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 07:59:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:28,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:29,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 07:59:29,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {5602#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {5602#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {5602#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:29,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {5602#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,022 INFO L272 TraceCheckUtils]: 14: Hoare triple {5636#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,023 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:29,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,025 INFO L272 TraceCheckUtils]: 22: Hoare triple {5661#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,026 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:29,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,027 INFO L272 TraceCheckUtils]: 30: Hoare triple {5686#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,029 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {5686#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:29,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,030 INFO L272 TraceCheckUtils]: 38: Hoare triple {5711#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,031 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {5711#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:29,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,033 INFO L272 TraceCheckUtils]: 46: Hoare triple {5736#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,034 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5761#(<= |main_#t~post5| 5)} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 07:59:29,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 07:59:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:29,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:29,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 07:59:29,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 07:59:29,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 07:59:29,331 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 07:59:29,331 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 07:59:29,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,331 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5595#false} is VALID [2022-04-08 07:59:29,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:29,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5823#(< ~counter~0 20)} is VALID [2022-04-08 07:59:29,339 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 20)} #55#return; {5823#(< ~counter~0 20)} is VALID [2022-04-08 07:59:29,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,339 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-08 07:59:29,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 20)} is VALID [2022-04-08 07:59:29,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5848#(< ~counter~0 19)} is VALID [2022-04-08 07:59:29,341 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 19)} #55#return; {5848#(< ~counter~0 19)} is VALID [2022-04-08 07:59:29,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,341 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-08 07:59:29,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 19)} is VALID [2022-04-08 07:59:29,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5873#(< ~counter~0 18)} is VALID [2022-04-08 07:59:29,342 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 18)} #55#return; {5873#(< ~counter~0 18)} is VALID [2022-04-08 07:59:29,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,343 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-08 07:59:29,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 18)} is VALID [2022-04-08 07:59:29,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5898#(< ~counter~0 17)} is VALID [2022-04-08 07:59:29,344 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 17)} #55#return; {5898#(< ~counter~0 17)} is VALID [2022-04-08 07:59:29,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,344 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-08 07:59:29,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {5923#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 17)} is VALID [2022-04-08 07:59:29,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {5923#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5923#(< ~counter~0 16)} is VALID [2022-04-08 07:59:29,345 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5923#(< ~counter~0 16)} #55#return; {5923#(< ~counter~0 16)} is VALID [2022-04-08 07:59:29,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,346 INFO L272 TraceCheckUtils]: 14: Hoare triple {5923#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {5923#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-08 07:59:29,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5923#(< ~counter~0 16)} is VALID [2022-04-08 07:59:29,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {5948#(< ~counter~0 15)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5948#(< ~counter~0 15)} #53#return; {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 07:59:29,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 07:59:29,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 07:59:29,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {5948#(< ~counter~0 15)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-08 07:59:29,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {5948#(< ~counter~0 15)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {5948#(< ~counter~0 15)} call #t~ret6 := main(); {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5948#(< ~counter~0 15)} {5594#true} #61#return; {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {5948#(< ~counter~0 15)} assume true; {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5948#(< ~counter~0 15)} is VALID [2022-04-08 07:59:29,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 07:59:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 07:59:29,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053104320] [2022-04-08 07:59:29,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703566492] [2022-04-08 07:59:29,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703566492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:29,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:29,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 07:59:29,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:29,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607378546] [2022-04-08 07:59:29,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607378546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:29,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:29,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:59:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588800383] [2022-04-08 07:59:29,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:29,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-08 07:59:29,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:29,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:29,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:29,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:59:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:29,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:59:29,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:59:29,402 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:29,630 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-08 07:59:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:59:29,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-08 07:59:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 07:59:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 07:59:29,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-08 07:59:29,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:29,684 INFO L225 Difference]: With dead ends: 78 [2022-04-08 07:59:29,684 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 07:59:29,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 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-08 07:59:29,685 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:29,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 07:59:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 07:59:29,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:29,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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-08 07:59:29,760 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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-08 07:59:29,760 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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-08 07:59:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:29,763 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 07:59:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 07:59:29,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:29,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:29,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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 68 states. [2022-04-08 07:59:29,764 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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 68 states. [2022-04-08 07:59:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:29,765 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 07:59:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 07:59:29,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:29,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:29,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:29,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 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-08 07:59:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-08 07:59:29,766 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-08 07:59:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:29,766 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-08 07:59:29,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:59:29,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-08 07:59:29,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 07:59:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 07:59:29,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:29,883 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:29,900 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-08 07:59:30,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 07:59:30,099 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-08 07:59:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107385306] [2022-04-08 07:59:30,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:30,178 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:30,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:30,178 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-08 07:59:30,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:30,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733752686] [2022-04-08 07:59:30,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:30,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:30,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256932839] [2022-04-08 07:59:30,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:59:30,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:30,190 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-08 07:59:30,191 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-08 07:59:30,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:59:30,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:30,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:59:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:30,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:30,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {6425#true} call ULTIMATE.init(); {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {6425#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6425#true} {6425#true} #61#return; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {6425#true} call #t~ret6 := main(); {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {6425#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {6425#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6425#true} {6425#true} #53#return; {6425#true} is VALID [2022-04-08 07:59:30,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {6425#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:30,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:30,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:30,582 INFO L272 TraceCheckUtils]: 14: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,583 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6425#true} {6463#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6463#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:30,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {6463#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:30,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:30,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:30,584 INFO L272 TraceCheckUtils]: 22: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,584 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6425#true} {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:30,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {6488#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:30,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:30,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:30,585 INFO L272 TraceCheckUtils]: 30: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,586 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6425#true} {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:30,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {6513#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:30,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:30,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:30,587 INFO L272 TraceCheckUtils]: 38: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,587 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6425#true} {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:30,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {6538#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:59:30,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:59:30,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:59:30,589 INFO L272 TraceCheckUtils]: 46: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,589 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6425#true} {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:59:30,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {6563#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:59:30,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:59:30,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:59:30,590 INFO L272 TraceCheckUtils]: 54: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,591 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6425#true} {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:59:30,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {6588#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:59:30,591 INFO L272 TraceCheckUtils]: 60: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6425#true} is VALID [2022-04-08 07:59:30,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {6425#true} ~cond := #in~cond; {6425#true} is VALID [2022-04-08 07:59:30,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {6425#true} assume !(0 == ~cond); {6425#true} is VALID [2022-04-08 07:59:30,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {6425#true} assume true; {6425#true} is VALID [2022-04-08 07:59:30,592 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6425#true} {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:59:30,592 INFO L272 TraceCheckUtils]: 65: Hoare triple {6613#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:30,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {6632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:30,593 INFO L290 TraceCheckUtils]: 67: Hoare triple {6636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6426#false} is VALID [2022-04-08 07:59:30,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {6426#false} assume !false; {6426#false} is VALID [2022-04-08 07:59:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 07:59:30,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:30,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733752686] [2022-04-08 07:59:30,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256932839] [2022-04-08 07:59:30,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256932839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:30,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:30,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:59:30,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:30,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107385306] [2022-04-08 07:59:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107385306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:30,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:59:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128457011] [2022-04-08 07:59:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-08 07:59:30,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:30,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:59:30,886 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-08 07:59:30,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:59:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:30,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:59:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:59:30,887 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:59:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:31,440 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 07:59:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:59:31,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-08 07:59:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:59:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 07:59:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:59:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 07:59:31,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 07:59:31,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:31,492 INFO L225 Difference]: With dead ends: 76 [2022-04-08 07:59:31,492 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 07:59:31,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:59:31,493 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:31,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:59:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 07:59:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 07:59:31,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:31,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:31,558 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:31,558 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:31,559 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 07:59:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 07:59:31,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:31,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:31,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 07:59:31,560 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 07:59:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:31,561 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 07:59:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 07:59:31,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:31,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:31,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:31,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 07:59:31,562 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-08 07:59:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:31,562 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 07:59:31,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 07:59:31,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 07:59:31,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 07:59:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 07:59:31,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:31,728 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:31,745 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-08 07:59:31,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 07:59:31,943 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:31,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-08 07:59:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:31,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1121379649] [2022-04-08 07:59:32,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:32,044 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:32,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-08 07:59:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:32,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901759186] [2022-04-08 07:59:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:32,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:32,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1057239355] [2022-04-08 07:59:32,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:59:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:32,061 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-08 07:59:32,062 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-08 07:59:32,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:59:32,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:32,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 07:59:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:32,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:32,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-08 07:59:32,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7146#(<= ~counter~0 0)} {7138#true} #61#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {7146#(<= ~counter~0 0)} call #t~ret6 := main(); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {7146#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {7146#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {7146#(<= ~counter~0 0)} ~cond := #in~cond; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {7146#(<= ~counter~0 0)} assume !(0 == ~cond); {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {7146#(<= ~counter~0 0)} assume true; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7146#(<= ~counter~0 0)} {7146#(<= ~counter~0 0)} #53#return; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {7146#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7146#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:32,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {7146#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,423 INFO L272 TraceCheckUtils]: 14: Hoare triple {7180#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {7180#(<= ~counter~0 1)} ~cond := #in~cond; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {7180#(<= ~counter~0 1)} assume !(0 == ~cond); {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {7180#(<= ~counter~0 1)} assume true; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,437 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7180#(<= ~counter~0 1)} {7180#(<= ~counter~0 1)} #55#return; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {7180#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7180#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:32,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {7180#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {7205#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,439 INFO L272 TraceCheckUtils]: 22: Hoare triple {7205#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {7205#(<= ~counter~0 2)} ~cond := #in~cond; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {7205#(<= ~counter~0 2)} assume !(0 == ~cond); {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {7205#(<= ~counter~0 2)} assume true; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,440 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7205#(<= ~counter~0 2)} {7205#(<= ~counter~0 2)} #55#return; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {7205#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7205#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:32,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {7205#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {7230#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,442 INFO L272 TraceCheckUtils]: 30: Hoare triple {7230#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {7230#(<= ~counter~0 3)} ~cond := #in~cond; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {7230#(<= ~counter~0 3)} assume !(0 == ~cond); {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {7230#(<= ~counter~0 3)} assume true; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,443 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7230#(<= ~counter~0 3)} {7230#(<= ~counter~0 3)} #55#return; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {7230#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7230#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:32,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {7230#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {7255#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,444 INFO L272 TraceCheckUtils]: 38: Hoare triple {7255#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {7255#(<= ~counter~0 4)} ~cond := #in~cond; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {7255#(<= ~counter~0 4)} assume !(0 == ~cond); {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {7255#(<= ~counter~0 4)} assume true; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,445 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7255#(<= ~counter~0 4)} {7255#(<= ~counter~0 4)} #55#return; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {7255#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:32,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {7255#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {7280#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,446 INFO L272 TraceCheckUtils]: 46: Hoare triple {7280#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {7280#(<= ~counter~0 5)} ~cond := #in~cond; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {7280#(<= ~counter~0 5)} assume !(0 == ~cond); {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {7280#(<= ~counter~0 5)} assume true; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,447 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7280#(<= ~counter~0 5)} {7280#(<= ~counter~0 5)} #55#return; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {7280#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7280#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:32,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {7280#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {7305#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,449 INFO L272 TraceCheckUtils]: 54: Hoare triple {7305#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {7305#(<= ~counter~0 6)} ~cond := #in~cond; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {7305#(<= ~counter~0 6)} assume !(0 == ~cond); {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= ~counter~0 6)} assume true; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,450 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7305#(<= ~counter~0 6)} {7305#(<= ~counter~0 6)} #55#return; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {7305#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7305#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:32,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {7305#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7330#(<= |main_#t~post5| 6)} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {7330#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {7139#false} assume !(0 == ~cond); {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {7139#false} assume true; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7139#false} {7139#false} #57#return; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-08 07:59:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:32,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:32,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {7139#false} assume !false; {7139#false} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {7139#false} assume 0 == ~cond; {7139#false} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {7139#false} ~cond := #in~cond; {7139#false} is VALID [2022-04-08 07:59:32,782 INFO L272 TraceCheckUtils]: 67: Hoare triple {7139#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7139#false} is VALID [2022-04-08 07:59:32,782 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7138#true} {7139#false} #57#return; {7139#false} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,782 INFO L272 TraceCheckUtils]: 62: Hoare triple {7139#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {7388#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7139#false} is VALID [2022-04-08 07:59:32,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {7392#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7388#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:32,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {7392#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7392#(< ~counter~0 20)} is VALID [2022-04-08 07:59:32,783 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7138#true} {7392#(< ~counter~0 20)} #55#return; {7392#(< ~counter~0 20)} is VALID [2022-04-08 07:59:32,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,783 INFO L272 TraceCheckUtils]: 54: Hoare triple {7392#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {7392#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-08 07:59:32,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {7417#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7392#(< ~counter~0 20)} is VALID [2022-04-08 07:59:32,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {7417#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7417#(< ~counter~0 19)} is VALID [2022-04-08 07:59:32,785 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7138#true} {7417#(< ~counter~0 19)} #55#return; {7417#(< ~counter~0 19)} is VALID [2022-04-08 07:59:32,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,785 INFO L272 TraceCheckUtils]: 46: Hoare triple {7417#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {7417#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-08 07:59:32,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {7442#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 19)} is VALID [2022-04-08 07:59:32,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {7442#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7442#(< ~counter~0 18)} is VALID [2022-04-08 07:59:32,786 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7138#true} {7442#(< ~counter~0 18)} #55#return; {7442#(< ~counter~0 18)} is VALID [2022-04-08 07:59:32,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,786 INFO L272 TraceCheckUtils]: 38: Hoare triple {7442#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {7442#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-08 07:59:32,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {7467#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7442#(< ~counter~0 18)} is VALID [2022-04-08 07:59:32,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {7467#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7467#(< ~counter~0 17)} is VALID [2022-04-08 07:59:32,788 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7138#true} {7467#(< ~counter~0 17)} #55#return; {7467#(< ~counter~0 17)} is VALID [2022-04-08 07:59:32,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,788 INFO L272 TraceCheckUtils]: 30: Hoare triple {7467#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {7467#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-08 07:59:32,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {7492#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7467#(< ~counter~0 17)} is VALID [2022-04-08 07:59:32,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {7492#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7492#(< ~counter~0 16)} is VALID [2022-04-08 07:59:32,789 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7138#true} {7492#(< ~counter~0 16)} #55#return; {7492#(< ~counter~0 16)} is VALID [2022-04-08 07:59:32,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,789 INFO L272 TraceCheckUtils]: 22: Hoare triple {7492#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {7492#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-08 07:59:32,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {7517#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7492#(< ~counter~0 16)} is VALID [2022-04-08 07:59:32,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {7517#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7517#(< ~counter~0 15)} is VALID [2022-04-08 07:59:32,791 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7138#true} {7517#(< ~counter~0 15)} #55#return; {7517#(< ~counter~0 15)} is VALID [2022-04-08 07:59:32,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,791 INFO L272 TraceCheckUtils]: 14: Hoare triple {7517#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {7517#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-08 07:59:32,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {7542#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7517#(< ~counter~0 15)} is VALID [2022-04-08 07:59:32,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {7542#(< ~counter~0 14)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7138#true} {7542#(< ~counter~0 14)} #53#return; {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {7138#true} assume true; {7138#true} is VALID [2022-04-08 07:59:32,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {7138#true} assume !(0 == ~cond); {7138#true} is VALID [2022-04-08 07:59:32,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {7138#true} ~cond := #in~cond; {7138#true} is VALID [2022-04-08 07:59:32,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {7542#(< ~counter~0 14)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7138#true} is VALID [2022-04-08 07:59:32,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {7542#(< ~counter~0 14)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {7542#(< ~counter~0 14)} call #t~ret6 := main(); {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7542#(< ~counter~0 14)} {7138#true} #61#return; {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {7542#(< ~counter~0 14)} assume true; {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {7138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7542#(< ~counter~0 14)} is VALID [2022-04-08 07:59:32,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {7138#true} call ULTIMATE.init(); {7138#true} is VALID [2022-04-08 07:59:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 07:59:32,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:32,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901759186] [2022-04-08 07:59:32,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:32,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057239355] [2022-04-08 07:59:32,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057239355] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:32,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:32,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 07:59:32,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:32,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1121379649] [2022-04-08 07:59:32,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1121379649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:32,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:32,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:59:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492098991] [2022-04-08 07:59:32,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-08 07:59:32,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:32,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:32,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:32,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:59:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:32,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:59:32,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:59:32,843 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:33,076 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-08 07:59:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:59:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-08 07:59:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 07:59:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 07:59:33,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-08 07:59:33,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:33,143 INFO L225 Difference]: With dead ends: 86 [2022-04-08 07:59:33,143 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 07:59:33,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 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-08 07:59:33,143 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:33,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 07:59:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 07:59:33,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:33,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-08 07:59:33,220 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-08 07:59:33,220 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-08 07:59:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:33,238 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 07:59:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 07:59:33,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:33,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:33,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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 76 states. [2022-04-08 07:59:33,239 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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 76 states. [2022-04-08 07:59:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:33,240 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 07:59:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 07:59:33,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:33,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:33,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:33,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-08 07:59:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-08 07:59:33,241 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-08 07:59:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:33,241 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-08 07:59:33,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:59:33,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-08 07:59:33,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 07:59:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 07:59:33,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:33,409 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:33,425 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-08 07:59:33,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:33,610 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:33,610 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-08 07:59:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:33,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298711613] [2022-04-08 07:59:33,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:33,704 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:33,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-08 07:59:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:33,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840977236] [2022-04-08 07:59:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:33,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:33,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559963202] [2022-04-08 07:59:33,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:59:33,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:33,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:33,714 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-08 07:59:33,717 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-08 07:59:39,007 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:59:39,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:39,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 07:59:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:39,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:39,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {8069#true} call ULTIMATE.init(); {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {8069#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8069#true} {8069#true} #61#return; {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {8069#true} call #t~ret6 := main(); {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {8069#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {8069#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8069#true} {8069#true} #53#return; {8069#true} is VALID [2022-04-08 07:59:39,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {8069#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:39,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:39,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:39,537 INFO L272 TraceCheckUtils]: 14: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,538 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8069#true} {8107#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8107#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:39,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {8107#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:39,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:39,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:39,539 INFO L272 TraceCheckUtils]: 22: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8069#true} {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:59:39,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {8132#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:39,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:39,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:39,540 INFO L272 TraceCheckUtils]: 30: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,541 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8069#true} {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 07:59:39,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {8157#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:39,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:39,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:39,543 INFO L272 TraceCheckUtils]: 38: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,547 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8069#true} {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:59:39,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {8182#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:39,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:39,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:39,548 INFO L272 TraceCheckUtils]: 46: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,548 INFO L290 TraceCheckUtils]: 47: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,549 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8069#true} {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:39,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {8207#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 07:59:39,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 07:59:39,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 07:59:39,550 INFO L272 TraceCheckUtils]: 54: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,551 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8069#true} {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 07:59:39,551 INFO L290 TraceCheckUtils]: 59: Hoare triple {8232#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:59:39,551 INFO L290 TraceCheckUtils]: 60: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:59:39,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:59:39,552 INFO L272 TraceCheckUtils]: 62: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,552 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8069#true} {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:59:39,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {8257#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:59:39,553 INFO L272 TraceCheckUtils]: 68: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8069#true} is VALID [2022-04-08 07:59:39,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {8069#true} ~cond := #in~cond; {8069#true} is VALID [2022-04-08 07:59:39,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {8069#true} assume !(0 == ~cond); {8069#true} is VALID [2022-04-08 07:59:39,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {8069#true} assume true; {8069#true} is VALID [2022-04-08 07:59:39,554 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8069#true} {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:59:39,554 INFO L272 TraceCheckUtils]: 73: Hoare triple {8282#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:39,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {8301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:39,555 INFO L290 TraceCheckUtils]: 75: Hoare triple {8305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8070#false} is VALID [2022-04-08 07:59:39,555 INFO L290 TraceCheckUtils]: 76: Hoare triple {8070#false} assume !false; {8070#false} is VALID [2022-04-08 07:59:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 07:59:39,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840977236] [2022-04-08 07:59:40,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559963202] [2022-04-08 07:59:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559963202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:40,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:40,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:59:40,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298711613] [2022-04-08 07:59:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298711613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:40,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:40,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:59:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488362250] [2022-04-08 07:59:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:40,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-08 07:59:40,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:40,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:59:40,207 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-08 07:59:40,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:59:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:59:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:59:40,208 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:59:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:40,920 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-08 07:59:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:59:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-08 07:59:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:59:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 07:59:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:59:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 07:59:40,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 07:59:40,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:40,977 INFO L225 Difference]: With dead ends: 84 [2022-04-08 07:59:40,977 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 07:59:40,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:59:40,977 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:40,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:59:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 07:59:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 07:59:41,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:41,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:41,079 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:41,079 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:41,080 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 07:59:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 07:59:41,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:41,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:41,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-08 07:59:41,081 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-08 07:59:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:41,082 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 07:59:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 07:59:41,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:41,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:41,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:41,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 07:59:41,084 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-08 07:59:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:41,085 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 07:59:41,085 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 07:59:41,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 07:59:41,217 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-08 07:59:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 07:59:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 07:59:41,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:41,217 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:41,228 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-08 07:59:41,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 07:59:41,426 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:41,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-08 07:59:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:41,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929294811] [2022-04-08 07:59:41,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:41,517 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:41,518 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-08 07:59:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:41,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407377729] [2022-04-08 07:59:41,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:41,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:41,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:41,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187240298] [2022-04-08 07:59:41,528 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:59:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:41,529 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-08 07:59:41,560 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-08 07:59:41,722 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 07:59:41,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:41,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 07:59:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:41,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:42,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-08 07:59:42,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#(<= ~counter~0 0)} {8955#true} #61#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#(<= ~counter~0 0)} call #t~ret6 := main(); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {8963#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {8963#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#(<= ~counter~0 0)} ~cond := #in~cond; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#(<= ~counter~0 0)} assume !(0 == ~cond); {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#(<= ~counter~0 0)} assume true; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#(<= ~counter~0 0)} {8963#(<= ~counter~0 0)} #53#return; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {8963#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8963#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:42,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {8963#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,081 INFO L272 TraceCheckUtils]: 14: Hoare triple {8997#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(<= ~counter~0 1)} ~cond := #in~cond; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(<= ~counter~0 1)} assume !(0 == ~cond); {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(<= ~counter~0 1)} assume true; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,082 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8997#(<= ~counter~0 1)} {8997#(<= ~counter~0 1)} #55#return; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {8997#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8997#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:42,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {8997#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {9022#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,083 INFO L272 TraceCheckUtils]: 22: Hoare triple {9022#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#(<= ~counter~0 2)} ~cond := #in~cond; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#(<= ~counter~0 2)} assume !(0 == ~cond); {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {9022#(<= ~counter~0 2)} assume true; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,084 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9022#(<= ~counter~0 2)} {9022#(<= ~counter~0 2)} #55#return; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {9022#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9022#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:42,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {9022#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {9047#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,085 INFO L272 TraceCheckUtils]: 30: Hoare triple {9047#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {9047#(<= ~counter~0 3)} ~cond := #in~cond; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {9047#(<= ~counter~0 3)} assume !(0 == ~cond); {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {9047#(<= ~counter~0 3)} assume true; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,086 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9047#(<= ~counter~0 3)} {9047#(<= ~counter~0 3)} #55#return; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {9047#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9047#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:42,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {9047#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {9072#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,088 INFO L272 TraceCheckUtils]: 38: Hoare triple {9072#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {9072#(<= ~counter~0 4)} ~cond := #in~cond; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {9072#(<= ~counter~0 4)} assume !(0 == ~cond); {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {9072#(<= ~counter~0 4)} assume true; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,089 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9072#(<= ~counter~0 4)} {9072#(<= ~counter~0 4)} #55#return; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {9072#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:42,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {9072#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {9097#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,090 INFO L272 TraceCheckUtils]: 46: Hoare triple {9097#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {9097#(<= ~counter~0 5)} ~cond := #in~cond; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {9097#(<= ~counter~0 5)} assume !(0 == ~cond); {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {9097#(<= ~counter~0 5)} assume true; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,091 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9097#(<= ~counter~0 5)} {9097#(<= ~counter~0 5)} #55#return; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {9097#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:42,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {9097#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {9122#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,093 INFO L272 TraceCheckUtils]: 54: Hoare triple {9122#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {9122#(<= ~counter~0 6)} ~cond := #in~cond; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {9122#(<= ~counter~0 6)} assume !(0 == ~cond); {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {9122#(<= ~counter~0 6)} assume true; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,094 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9122#(<= ~counter~0 6)} {9122#(<= ~counter~0 6)} #55#return; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {9122#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:42,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {9122#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,095 INFO L272 TraceCheckUtils]: 62: Hoare triple {9147#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(<= ~counter~0 7)} ~cond := #in~cond; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {9147#(<= ~counter~0 7)} assume !(0 == ~cond); {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {9147#(<= ~counter~0 7)} assume true; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,096 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9147#(<= ~counter~0 7)} {9147#(<= ~counter~0 7)} #55#return; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {9147#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {9147#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= |main_#t~post5| 7)} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {9172#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {8956#false} assume !(0 == ~cond); {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {8956#false} assume true; {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8956#false} {8956#false} #57#return; {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-08 07:59:42,097 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-08 07:59:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:42,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:42,505 INFO L290 TraceCheckUtils]: 78: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-08 07:59:42,505 INFO L290 TraceCheckUtils]: 77: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-08 07:59:42,506 INFO L290 TraceCheckUtils]: 76: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-08 07:59:42,506 INFO L272 TraceCheckUtils]: 75: Hoare triple {8956#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8956#false} is VALID [2022-04-08 07:59:42,506 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8955#true} {8956#false} #57#return; {8956#false} is VALID [2022-04-08 07:59:42,506 INFO L290 TraceCheckUtils]: 73: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,506 INFO L272 TraceCheckUtils]: 70: Hoare triple {8956#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {9230#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {8956#false} is VALID [2022-04-08 07:59:42,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {9234#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9230#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:42,507 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9234#(< ~counter~0 20)} is VALID [2022-04-08 07:59:42,507 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8955#true} {9234#(< ~counter~0 20)} #55#return; {9234#(< ~counter~0 20)} is VALID [2022-04-08 07:59:42,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,507 INFO L290 TraceCheckUtils]: 64: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,507 INFO L272 TraceCheckUtils]: 62: Hoare triple {9234#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {9234#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-08 07:59:42,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {9259#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(< ~counter~0 20)} is VALID [2022-04-08 07:59:42,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {9259#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9259#(< ~counter~0 19)} is VALID [2022-04-08 07:59:42,509 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8955#true} {9259#(< ~counter~0 19)} #55#return; {9259#(< ~counter~0 19)} is VALID [2022-04-08 07:59:42,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,509 INFO L272 TraceCheckUtils]: 54: Hoare triple {9259#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {9259#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-08 07:59:42,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {9284#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(< ~counter~0 19)} is VALID [2022-04-08 07:59:42,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9284#(< ~counter~0 18)} is VALID [2022-04-08 07:59:42,510 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8955#true} {9284#(< ~counter~0 18)} #55#return; {9284#(< ~counter~0 18)} is VALID [2022-04-08 07:59:42,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,511 INFO L272 TraceCheckUtils]: 46: Hoare triple {9284#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-08 07:59:42,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {9309#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(< ~counter~0 18)} is VALID [2022-04-08 07:59:42,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {9309#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9309#(< ~counter~0 17)} is VALID [2022-04-08 07:59:42,512 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8955#true} {9309#(< ~counter~0 17)} #55#return; {9309#(< ~counter~0 17)} is VALID [2022-04-08 07:59:42,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,512 INFO L290 TraceCheckUtils]: 39: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,512 INFO L272 TraceCheckUtils]: 38: Hoare triple {9309#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {9309#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-08 07:59:42,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {9334#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(< ~counter~0 17)} is VALID [2022-04-08 07:59:42,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {9334#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9334#(< ~counter~0 16)} is VALID [2022-04-08 07:59:42,514 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8955#true} {9334#(< ~counter~0 16)} #55#return; {9334#(< ~counter~0 16)} is VALID [2022-04-08 07:59:42,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,514 INFO L272 TraceCheckUtils]: 30: Hoare triple {9334#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {9334#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-08 07:59:42,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {9359#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(< ~counter~0 16)} is VALID [2022-04-08 07:59:42,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {9359#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9359#(< ~counter~0 15)} is VALID [2022-04-08 07:59:42,515 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8955#true} {9359#(< ~counter~0 15)} #55#return; {9359#(< ~counter~0 15)} is VALID [2022-04-08 07:59:42,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,515 INFO L272 TraceCheckUtils]: 22: Hoare triple {9359#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {9359#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-08 07:59:42,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {9384#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(< ~counter~0 15)} is VALID [2022-04-08 07:59:42,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {9384#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9384#(< ~counter~0 14)} is VALID [2022-04-08 07:59:42,517 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8955#true} {9384#(< ~counter~0 14)} #55#return; {9384#(< ~counter~0 14)} is VALID [2022-04-08 07:59:42,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,517 INFO L272 TraceCheckUtils]: 14: Hoare triple {9384#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {9384#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-08 07:59:42,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {9409#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9384#(< ~counter~0 14)} is VALID [2022-04-08 07:59:42,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#(< ~counter~0 13)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8955#true} {9409#(< ~counter~0 13)} #53#return; {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-08 07:59:42,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {8955#true} assume !(0 == ~cond); {8955#true} is VALID [2022-04-08 07:59:42,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {8955#true} ~cond := #in~cond; {8955#true} is VALID [2022-04-08 07:59:42,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {9409#(< ~counter~0 13)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8955#true} is VALID [2022-04-08 07:59:42,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {9409#(< ~counter~0 13)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {9409#(< ~counter~0 13)} call #t~ret6 := main(); {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9409#(< ~counter~0 13)} {8955#true} #61#return; {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {9409#(< ~counter~0 13)} assume true; {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9409#(< ~counter~0 13)} is VALID [2022-04-08 07:59:42,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2022-04-08 07:59:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 07:59:42,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:42,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407377729] [2022-04-08 07:59:42,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:42,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187240298] [2022-04-08 07:59:42,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187240298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:42,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:42,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 07:59:42,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:42,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929294811] [2022-04-08 07:59:42,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929294811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:42,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:42,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:59:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863366955] [2022-04-08 07:59:42,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-08 07:59:42,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:42,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:42,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:42,582 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:59:42,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:59:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:59:42,583 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:42,885 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-08 07:59:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 07:59:42,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-08 07:59:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 07:59:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 07:59:42,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-08 07:59:42,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:42,953 INFO L225 Difference]: With dead ends: 94 [2022-04-08 07:59:42,953 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 07:59:42,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-08 07:59:42,954 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:42,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 07:59:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 07:59:43,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:43,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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-08 07:59:43,047 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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-08 07:59:43,047 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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-08 07:59:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:43,048 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 07:59:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 07:59:43,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:43,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:43,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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 84 states. [2022-04-08 07:59:43,048 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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 84 states. [2022-04-08 07:59:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:43,049 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 07:59:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 07:59:43,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:43,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:43,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:43,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 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-08 07:59:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-08 07:59:43,051 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-08 07:59:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:43,051 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-08 07:59:43,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:59:43,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-08 07:59:43,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 07:59:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 07:59:43,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:43,235 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:43,239 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-08 07:59:43,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 07:59:43,440 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-08 07:59:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:43,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1333356696] [2022-04-08 07:59:43,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:43,520 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:43,520 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-08 07:59:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:43,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000098290] [2022-04-08 07:59:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:43,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:43,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127438656] [2022-04-08 07:59:43,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:43,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:43,535 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-08 07:59:43,536 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-08 07:59:44,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:44,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:44,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:59:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:44,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:45,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {9986#true} call ULTIMATE.init(); {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {9986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9986#true} {9986#true} #61#return; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {9986#true} call #t~ret6 := main(); {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {9986#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L272 TraceCheckUtils]: 6: Hoare triple {9986#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9986#true} {9986#true} #53#return; {9986#true} is VALID [2022-04-08 07:59:45,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {9986#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:45,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:45,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:45,064 INFO L272 TraceCheckUtils]: 14: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,065 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9986#true} {10024#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10024#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:45,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {10024#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:59:45,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:59:45,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:59:45,066 INFO L272 TraceCheckUtils]: 22: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,066 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9986#true} {10049#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10049#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:59:45,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {10049#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:59:45,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:59:45,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:59:45,067 INFO L272 TraceCheckUtils]: 30: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,068 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9986#true} {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 07:59:45,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {10074#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:45,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:45,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:45,069 INFO L272 TraceCheckUtils]: 38: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,070 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9986#true} {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:45,070 INFO L290 TraceCheckUtils]: 43: Hoare triple {10099#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:59:45,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:59:45,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:59:45,071 INFO L272 TraceCheckUtils]: 46: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,071 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9986#true} {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 07:59:45,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {10124#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,072 INFO L272 TraceCheckUtils]: 54: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,073 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9986#true} {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {10149#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,074 INFO L272 TraceCheckUtils]: 62: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,074 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9986#true} {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:59:45,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {10174#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 07:59:45,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 07:59:45,076 INFO L290 TraceCheckUtils]: 69: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 07:59:45,076 INFO L272 TraceCheckUtils]: 70: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,077 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9986#true} {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 07:59:45,077 INFO L290 TraceCheckUtils]: 75: Hoare triple {10199#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 07:59:45,077 INFO L272 TraceCheckUtils]: 76: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9986#true} is VALID [2022-04-08 07:59:45,077 INFO L290 TraceCheckUtils]: 77: Hoare triple {9986#true} ~cond := #in~cond; {9986#true} is VALID [2022-04-08 07:59:45,077 INFO L290 TraceCheckUtils]: 78: Hoare triple {9986#true} assume !(0 == ~cond); {9986#true} is VALID [2022-04-08 07:59:45,077 INFO L290 TraceCheckUtils]: 79: Hoare triple {9986#true} assume true; {9986#true} is VALID [2022-04-08 07:59:45,078 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9986#true} {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 07:59:45,078 INFO L272 TraceCheckUtils]: 81: Hoare triple {10224#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:45,079 INFO L290 TraceCheckUtils]: 82: Hoare triple {10243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:45,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {10247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9987#false} is VALID [2022-04-08 07:59:45,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {9987#false} assume !false; {9987#false} is VALID [2022-04-08 07:59:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 07:59:45,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000098290] [2022-04-08 07:59:45,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:45,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127438656] [2022-04-08 07:59:45,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127438656] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:45,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:45,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:59:45,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:45,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1333356696] [2022-04-08 07:59:45,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1333356696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:45,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:45,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:59:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914581461] [2022-04-08 07:59:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:45,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-08 07:59:45,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:45,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:59:45,403 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-08 07:59:45,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:59:45,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:59:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:59:45,404 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:59:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:46,230 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-08 07:59:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:59:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-08 07:59:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:59:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 07:59:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:59:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 07:59:46,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 07:59:46,286 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-08 07:59:46,287 INFO L225 Difference]: With dead ends: 92 [2022-04-08 07:59:46,287 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 07:59:46,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:59:46,288 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:46,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:59:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 07:59:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 07:59:46,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:46,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:46,382 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:46,382 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:46,384 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 07:59:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 07:59:46,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:46,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:46,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-08 07:59:46,384 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-08 07:59:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:46,385 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 07:59:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 07:59:46,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:46,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:46,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:46,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-08 07:59:46,387 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-08 07:59:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:46,387 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-08 07:59:46,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 07:59:46,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-08 07:59:46,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 07:59:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 07:59:46,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:46,749 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:46,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 07:59:46,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 07:59:46,956 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-08 07:59:46,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:46,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358679986] [2022-04-08 07:59:47,038 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:47,039 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:47,039 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-08 07:59:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:47,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036209769] [2022-04-08 07:59:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:47,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:47,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:47,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038178935] [2022-04-08 07:59:47,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:59:47,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:47,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:47,050 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-08 07:59:47,051 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-08 07:59:47,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:59:47,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:47,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 07:59:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:47,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:47,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-08 07:59:47,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10853#(<= ~counter~0 0)} {10845#true} #61#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {10853#(<= ~counter~0 0)} call #t~ret6 := main(); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {10853#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {10853#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {10853#(<= ~counter~0 0)} ~cond := #in~cond; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {10853#(<= ~counter~0 0)} assume !(0 == ~cond); {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {10853#(<= ~counter~0 0)} assume true; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10853#(<= ~counter~0 0)} {10853#(<= ~counter~0 0)} #53#return; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {10853#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10853#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:47,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {10853#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {10887#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,529 INFO L272 TraceCheckUtils]: 14: Hoare triple {10887#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {10887#(<= ~counter~0 1)} ~cond := #in~cond; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(<= ~counter~0 1)} assume !(0 == ~cond); {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {10887#(<= ~counter~0 1)} assume true; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,530 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10887#(<= ~counter~0 1)} {10887#(<= ~counter~0 1)} #55#return; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {10887#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10887#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:47,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {10887#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {10912#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,532 INFO L272 TraceCheckUtils]: 22: Hoare triple {10912#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {10912#(<= ~counter~0 2)} ~cond := #in~cond; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {10912#(<= ~counter~0 2)} assume !(0 == ~cond); {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {10912#(<= ~counter~0 2)} assume true; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,533 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10912#(<= ~counter~0 2)} {10912#(<= ~counter~0 2)} #55#return; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {10912#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10912#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:47,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {10912#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {10937#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,535 INFO L272 TraceCheckUtils]: 30: Hoare triple {10937#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {10937#(<= ~counter~0 3)} ~cond := #in~cond; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {10937#(<= ~counter~0 3)} assume !(0 == ~cond); {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {10937#(<= ~counter~0 3)} assume true; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,536 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10937#(<= ~counter~0 3)} {10937#(<= ~counter~0 3)} #55#return; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {10937#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10937#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:47,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {10937#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {10962#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,538 INFO L272 TraceCheckUtils]: 38: Hoare triple {10962#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {10962#(<= ~counter~0 4)} ~cond := #in~cond; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {10962#(<= ~counter~0 4)} assume !(0 == ~cond); {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {10962#(<= ~counter~0 4)} assume true; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,539 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10962#(<= ~counter~0 4)} {10962#(<= ~counter~0 4)} #55#return; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {10962#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10962#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:47,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {10962#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {10987#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,540 INFO L272 TraceCheckUtils]: 46: Hoare triple {10987#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {10987#(<= ~counter~0 5)} ~cond := #in~cond; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {10987#(<= ~counter~0 5)} assume !(0 == ~cond); {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {10987#(<= ~counter~0 5)} assume true; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,542 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10987#(<= ~counter~0 5)} {10987#(<= ~counter~0 5)} #55#return; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {10987#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10987#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:47,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {10987#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {11012#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,543 INFO L272 TraceCheckUtils]: 54: Hoare triple {11012#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {11012#(<= ~counter~0 6)} ~cond := #in~cond; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {11012#(<= ~counter~0 6)} assume !(0 == ~cond); {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {11012#(<= ~counter~0 6)} assume true; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,544 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11012#(<= ~counter~0 6)} {11012#(<= ~counter~0 6)} #55#return; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {11012#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11012#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:47,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {11012#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,545 INFO L290 TraceCheckUtils]: 61: Hoare triple {11037#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,546 INFO L272 TraceCheckUtils]: 62: Hoare triple {11037#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {11037#(<= ~counter~0 7)} ~cond := #in~cond; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(<= ~counter~0 7)} assume !(0 == ~cond); {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {11037#(<= ~counter~0 7)} assume true; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,547 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11037#(<= ~counter~0 7)} {11037#(<= ~counter~0 7)} #55#return; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {11037#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11037#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:47,548 INFO L290 TraceCheckUtils]: 68: Hoare triple {11037#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {11062#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,548 INFO L272 TraceCheckUtils]: 70: Hoare triple {11062#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {11062#(<= ~counter~0 8)} ~cond := #in~cond; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,549 INFO L290 TraceCheckUtils]: 72: Hoare triple {11062#(<= ~counter~0 8)} assume !(0 == ~cond); {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {11062#(<= ~counter~0 8)} assume true; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,550 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11062#(<= ~counter~0 8)} {11062#(<= ~counter~0 8)} #55#return; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,550 INFO L290 TraceCheckUtils]: 75: Hoare triple {11062#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11062#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:47,550 INFO L290 TraceCheckUtils]: 76: Hoare triple {11062#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11087#(<= |main_#t~post5| 8)} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 77: Hoare triple {11087#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 79: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 80: Hoare triple {10846#false} assume !(0 == ~cond); {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {10846#false} assume true; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10846#false} {10846#false} #57#return; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-08 07:59:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:47,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:47,973 INFO L290 TraceCheckUtils]: 86: Hoare triple {10846#false} assume !false; {10846#false} is VALID [2022-04-08 07:59:47,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {10846#false} assume 0 == ~cond; {10846#false} is VALID [2022-04-08 07:59:47,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {10846#false} ~cond := #in~cond; {10846#false} is VALID [2022-04-08 07:59:47,974 INFO L272 TraceCheckUtils]: 83: Hoare triple {10846#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10846#false} is VALID [2022-04-08 07:59:47,974 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10845#true} {10846#false} #57#return; {10846#false} is VALID [2022-04-08 07:59:47,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,974 INFO L272 TraceCheckUtils]: 78: Hoare triple {10846#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {11145#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10846#false} is VALID [2022-04-08 07:59:47,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {11149#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11145#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:47,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {11149#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11149#(< ~counter~0 20)} is VALID [2022-04-08 07:59:47,975 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10845#true} {11149#(< ~counter~0 20)} #55#return; {11149#(< ~counter~0 20)} is VALID [2022-04-08 07:59:47,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,975 INFO L290 TraceCheckUtils]: 72: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,975 INFO L272 TraceCheckUtils]: 70: Hoare triple {11149#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,976 INFO L290 TraceCheckUtils]: 69: Hoare triple {11149#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-08 07:59:47,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {11174#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11149#(< ~counter~0 20)} is VALID [2022-04-08 07:59:47,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {11174#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11174#(< ~counter~0 19)} is VALID [2022-04-08 07:59:47,977 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10845#true} {11174#(< ~counter~0 19)} #55#return; {11174#(< ~counter~0 19)} is VALID [2022-04-08 07:59:47,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,977 INFO L272 TraceCheckUtils]: 62: Hoare triple {11174#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {11174#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-08 07:59:47,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {11199#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11174#(< ~counter~0 19)} is VALID [2022-04-08 07:59:47,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {11199#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11199#(< ~counter~0 18)} is VALID [2022-04-08 07:59:47,979 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10845#true} {11199#(< ~counter~0 18)} #55#return; {11199#(< ~counter~0 18)} is VALID [2022-04-08 07:59:47,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,979 INFO L272 TraceCheckUtils]: 54: Hoare triple {11199#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {11199#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-08 07:59:47,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {11224#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11199#(< ~counter~0 18)} is VALID [2022-04-08 07:59:47,980 INFO L290 TraceCheckUtils]: 51: Hoare triple {11224#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11224#(< ~counter~0 17)} is VALID [2022-04-08 07:59:47,980 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10845#true} {11224#(< ~counter~0 17)} #55#return; {11224#(< ~counter~0 17)} is VALID [2022-04-08 07:59:47,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,980 INFO L272 TraceCheckUtils]: 46: Hoare triple {11224#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {11224#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-08 07:59:47,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {11249#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11224#(< ~counter~0 17)} is VALID [2022-04-08 07:59:47,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {11249#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11249#(< ~counter~0 16)} is VALID [2022-04-08 07:59:47,982 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10845#true} {11249#(< ~counter~0 16)} #55#return; {11249#(< ~counter~0 16)} is VALID [2022-04-08 07:59:47,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,982 INFO L272 TraceCheckUtils]: 38: Hoare triple {11249#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {11249#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-08 07:59:47,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {11274#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11249#(< ~counter~0 16)} is VALID [2022-04-08 07:59:47,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {11274#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11274#(< ~counter~0 15)} is VALID [2022-04-08 07:59:47,984 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10845#true} {11274#(< ~counter~0 15)} #55#return; {11274#(< ~counter~0 15)} is VALID [2022-04-08 07:59:47,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,984 INFO L272 TraceCheckUtils]: 30: Hoare triple {11274#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {11274#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-08 07:59:47,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {11299#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11274#(< ~counter~0 15)} is VALID [2022-04-08 07:59:47,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {11299#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11299#(< ~counter~0 14)} is VALID [2022-04-08 07:59:47,986 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10845#true} {11299#(< ~counter~0 14)} #55#return; {11299#(< ~counter~0 14)} is VALID [2022-04-08 07:59:47,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,986 INFO L272 TraceCheckUtils]: 22: Hoare triple {11299#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {11299#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-08 07:59:47,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {11324#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11299#(< ~counter~0 14)} is VALID [2022-04-08 07:59:47,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {11324#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11324#(< ~counter~0 13)} is VALID [2022-04-08 07:59:47,987 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10845#true} {11324#(< ~counter~0 13)} #55#return; {11324#(< ~counter~0 13)} is VALID [2022-04-08 07:59:47,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,988 INFO L272 TraceCheckUtils]: 14: Hoare triple {11324#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {11324#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-08 07:59:47,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {11349#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11324#(< ~counter~0 13)} is VALID [2022-04-08 07:59:47,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {11349#(< ~counter~0 12)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10845#true} {11349#(< ~counter~0 12)} #53#return; {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {10845#true} assume true; {10845#true} is VALID [2022-04-08 07:59:47,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {10845#true} assume !(0 == ~cond); {10845#true} is VALID [2022-04-08 07:59:47,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {10845#true} ~cond := #in~cond; {10845#true} is VALID [2022-04-08 07:59:47,989 INFO L272 TraceCheckUtils]: 6: Hoare triple {11349#(< ~counter~0 12)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10845#true} is VALID [2022-04-08 07:59:47,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {11349#(< ~counter~0 12)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {11349#(< ~counter~0 12)} call #t~ret6 := main(); {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11349#(< ~counter~0 12)} {10845#true} #61#return; {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {11349#(< ~counter~0 12)} assume true; {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {10845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11349#(< ~counter~0 12)} is VALID [2022-04-08 07:59:47,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {10845#true} call ULTIMATE.init(); {10845#true} is VALID [2022-04-08 07:59:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 07:59:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:47,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036209769] [2022-04-08 07:59:47,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:47,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038178935] [2022-04-08 07:59:47,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038178935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:47,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:47,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 07:59:47,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:47,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358679986] [2022-04-08 07:59:47,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358679986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:47,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:47,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:59:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204889028] [2022-04-08 07:59:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:47,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-08 07:59:47,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:47,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:48,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:48,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:59:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:59:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:59:48,054 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:48,364 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-08 07:59:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 07:59:48,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-08 07:59:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 07:59:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 07:59:48,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-08 07:59:48,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:48,453 INFO L225 Difference]: With dead ends: 102 [2022-04-08 07:59:48,453 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 07:59:48,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 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-08 07:59:48,454 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:48,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:59:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 07:59:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 07:59:48,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:48,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-08 07:59:48,568 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-08 07:59:48,568 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-08 07:59:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:48,569 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 07:59:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 07:59:48,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:48,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:48,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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 92 states. [2022-04-08 07:59:48,570 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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 92 states. [2022-04-08 07:59:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:48,571 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 07:59:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 07:59:48,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:48,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:48,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:48,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-08 07:59:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-08 07:59:48,572 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-08 07:59:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:48,573 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-08 07:59:48,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:59:48,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-08 07:59:48,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 07:59:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 07:59:48,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:48,801 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:48,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 07:59:49,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:49,002 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-08 07:59:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:49,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223932353] [2022-04-08 07:59:49,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:49,091 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:49,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-08 07:59:49,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:49,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83171894] [2022-04-08 07:59:49,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:49,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1772220780] [2022-04-08 07:59:49,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:59:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:49,107 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-08 07:59:49,108 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-08 07:59:49,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:59:49,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:49,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:59:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:49,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:49,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {11976#true} call ULTIMATE.init(); {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {11976#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11976#true} {11976#true} #61#return; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {11976#true} call #t~ret6 := main(); {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {11976#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {11976#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11976#true} {11976#true} #53#return; {11976#true} is VALID [2022-04-08 07:59:49,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {11976#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:49,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:49,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:49,595 INFO L272 TraceCheckUtils]: 14: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,596 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11976#true} {12014#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {12014#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:59:49,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {12014#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:49,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:49,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:49,597 INFO L272 TraceCheckUtils]: 22: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,597 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11976#true} {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:59:49,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {12039#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:59:49,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:59:49,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:59:49,598 INFO L272 TraceCheckUtils]: 30: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,599 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11976#true} {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:59:49,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {12064#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:49,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:49,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:49,600 INFO L272 TraceCheckUtils]: 38: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,601 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11976#true} {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:59:49,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {12089#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:59:49,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:59:49,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:59:49,602 INFO L272 TraceCheckUtils]: 46: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,602 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11976#true} {12114#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12114#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:59:49,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {12114#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:59:49,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:59:49,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:59:49,603 INFO L272 TraceCheckUtils]: 54: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,604 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11976#true} {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:59:49,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {12139#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:59:49,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:59:49,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:59:49,605 INFO L272 TraceCheckUtils]: 62: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,605 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11976#true} {12164#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12164#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 07:59:49,606 INFO L290 TraceCheckUtils]: 67: Hoare triple {12164#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:49,606 INFO L290 TraceCheckUtils]: 68: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:49,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:49,606 INFO L272 TraceCheckUtils]: 70: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,606 INFO L290 TraceCheckUtils]: 73: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,607 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11976#true} {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:59:49,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {12189#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:59:49,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:59:49,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:59:49,608 INFO L272 TraceCheckUtils]: 78: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,608 INFO L290 TraceCheckUtils]: 79: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,608 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11976#true} {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 07:59:49,609 INFO L290 TraceCheckUtils]: 83: Hoare triple {12214#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 07:59:49,609 INFO L272 TraceCheckUtils]: 84: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11976#true} is VALID [2022-04-08 07:59:49,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {11976#true} ~cond := #in~cond; {11976#true} is VALID [2022-04-08 07:59:49,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {11976#true} assume !(0 == ~cond); {11976#true} is VALID [2022-04-08 07:59:49,609 INFO L290 TraceCheckUtils]: 87: Hoare triple {11976#true} assume true; {11976#true} is VALID [2022-04-08 07:59:49,610 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11976#true} {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 07:59:49,610 INFO L272 TraceCheckUtils]: 89: Hoare triple {12239#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:59:49,611 INFO L290 TraceCheckUtils]: 90: Hoare triple {12258#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12262#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:59:49,611 INFO L290 TraceCheckUtils]: 91: Hoare triple {12262#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11977#false} is VALID [2022-04-08 07:59:49,611 INFO L290 TraceCheckUtils]: 92: Hoare triple {11977#false} assume !false; {11977#false} is VALID [2022-04-08 07:59:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 07:59:49,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:49,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83171894] [2022-04-08 07:59:49,950 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:49,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772220780] [2022-04-08 07:59:49,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772220780] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:59:49,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:59:49,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:59:49,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:49,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223932353] [2022-04-08 07:59:49,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223932353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:49,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:49,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:59:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209154818] [2022-04-08 07:59:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-08 07:59:49,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:49,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:59:49,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:49,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:59:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:59:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:59:49,999 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:59:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:50,955 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-08 07:59:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:59:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-08 07:59:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:59:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 07:59:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:59:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 07:59:50,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-08 07:59:51,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:51,024 INFO L225 Difference]: With dead ends: 100 [2022-04-08 07:59:51,024 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 07:59:51,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:59:51,025 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:51,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:59:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 07:59:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 07:59:51,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:51,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:59:51,135 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:59:51,135 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:59:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:51,136 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 07:59:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 07:59:51,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:51,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:51,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-08 07:59:51,137 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-08 07:59:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:51,138 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 07:59:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 07:59:51,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:51,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:51,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:51,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:59:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-08 07:59:51,140 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-08 07:59:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:51,140 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-08 07:59:51,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 07:59:51,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-08 07:59:51,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 07:59:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 07:59:51,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:51,364 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:51,395 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-08 07:59:51,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:51,576 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-08 07:59:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:51,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1422862756] [2022-04-08 07:59:51,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:51,673 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:51,673 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-08 07:59:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:51,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794238761] [2022-04-08 07:59:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:51,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153603248] [2022-04-08 07:59:51,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:59:51,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:51,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:51,698 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-08 07:59:51,698 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-08 07:59:51,750 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:59:51,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:59:51,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 07:59:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:59:51,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:59:52,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 07:59:52,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12916#(<= ~counter~0 0)} {12908#true} #61#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {12916#(<= ~counter~0 0)} call #t~ret6 := main(); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {12916#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,202 INFO L272 TraceCheckUtils]: 6: Hoare triple {12916#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {12916#(<= ~counter~0 0)} ~cond := #in~cond; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {12916#(<= ~counter~0 0)} assume !(0 == ~cond); {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {12916#(<= ~counter~0 0)} assume true; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12916#(<= ~counter~0 0)} {12916#(<= ~counter~0 0)} #53#return; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {12916#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12916#(<= ~counter~0 0)} is VALID [2022-04-08 07:59:52,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {12916#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,205 INFO L272 TraceCheckUtils]: 14: Hoare triple {12950#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(<= ~counter~0 1)} ~cond := #in~cond; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#(<= ~counter~0 1)} assume !(0 == ~cond); {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#(<= ~counter~0 1)} assume true; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,206 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12950#(<= ~counter~0 1)} {12950#(<= ~counter~0 1)} #55#return; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12950#(<= ~counter~0 1)} is VALID [2022-04-08 07:59:52,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {12975#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,207 INFO L272 TraceCheckUtils]: 22: Hoare triple {12975#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {12975#(<= ~counter~0 2)} ~cond := #in~cond; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {12975#(<= ~counter~0 2)} assume !(0 == ~cond); {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {12975#(<= ~counter~0 2)} assume true; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,208 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12975#(<= ~counter~0 2)} {12975#(<= ~counter~0 2)} #55#return; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {12975#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12975#(<= ~counter~0 2)} is VALID [2022-04-08 07:59:52,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {12975#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {13000#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,209 INFO L272 TraceCheckUtils]: 30: Hoare triple {13000#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {13000#(<= ~counter~0 3)} ~cond := #in~cond; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {13000#(<= ~counter~0 3)} assume !(0 == ~cond); {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {13000#(<= ~counter~0 3)} assume true; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,210 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13000#(<= ~counter~0 3)} {13000#(<= ~counter~0 3)} #55#return; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {13000#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13000#(<= ~counter~0 3)} is VALID [2022-04-08 07:59:52,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {13000#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {13025#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,212 INFO L272 TraceCheckUtils]: 38: Hoare triple {13025#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {13025#(<= ~counter~0 4)} ~cond := #in~cond; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {13025#(<= ~counter~0 4)} assume !(0 == ~cond); {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {13025#(<= ~counter~0 4)} assume true; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,213 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13025#(<= ~counter~0 4)} {13025#(<= ~counter~0 4)} #55#return; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {13025#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13025#(<= ~counter~0 4)} is VALID [2022-04-08 07:59:52,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {13025#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {13050#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,214 INFO L272 TraceCheckUtils]: 46: Hoare triple {13050#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {13050#(<= ~counter~0 5)} ~cond := #in~cond; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {13050#(<= ~counter~0 5)} assume !(0 == ~cond); {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {13050#(<= ~counter~0 5)} assume true; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,215 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13050#(<= ~counter~0 5)} {13050#(<= ~counter~0 5)} #55#return; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {13050#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13050#(<= ~counter~0 5)} is VALID [2022-04-08 07:59:52,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {13050#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {13075#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,216 INFO L272 TraceCheckUtils]: 54: Hoare triple {13075#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {13075#(<= ~counter~0 6)} ~cond := #in~cond; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {13075#(<= ~counter~0 6)} assume !(0 == ~cond); {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {13075#(<= ~counter~0 6)} assume true; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,217 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13075#(<= ~counter~0 6)} {13075#(<= ~counter~0 6)} #55#return; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {13075#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13075#(<= ~counter~0 6)} is VALID [2022-04-08 07:59:52,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {13075#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,218 INFO L290 TraceCheckUtils]: 61: Hoare triple {13100#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,219 INFO L272 TraceCheckUtils]: 62: Hoare triple {13100#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,219 INFO L290 TraceCheckUtils]: 63: Hoare triple {13100#(<= ~counter~0 7)} ~cond := #in~cond; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {13100#(<= ~counter~0 7)} assume !(0 == ~cond); {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {13100#(<= ~counter~0 7)} assume true; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,220 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13100#(<= ~counter~0 7)} {13100#(<= ~counter~0 7)} #55#return; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,220 INFO L290 TraceCheckUtils]: 67: Hoare triple {13100#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13100#(<= ~counter~0 7)} is VALID [2022-04-08 07:59:52,220 INFO L290 TraceCheckUtils]: 68: Hoare triple {13100#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {13125#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,221 INFO L272 TraceCheckUtils]: 70: Hoare triple {13125#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,221 INFO L290 TraceCheckUtils]: 71: Hoare triple {13125#(<= ~counter~0 8)} ~cond := #in~cond; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,221 INFO L290 TraceCheckUtils]: 72: Hoare triple {13125#(<= ~counter~0 8)} assume !(0 == ~cond); {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,222 INFO L290 TraceCheckUtils]: 73: Hoare triple {13125#(<= ~counter~0 8)} assume true; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,222 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13125#(<= ~counter~0 8)} {13125#(<= ~counter~0 8)} #55#return; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,222 INFO L290 TraceCheckUtils]: 75: Hoare triple {13125#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13125#(<= ~counter~0 8)} is VALID [2022-04-08 07:59:52,223 INFO L290 TraceCheckUtils]: 76: Hoare triple {13125#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {13150#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,223 INFO L272 TraceCheckUtils]: 78: Hoare triple {13150#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {13150#(<= ~counter~0 9)} ~cond := #in~cond; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {13150#(<= ~counter~0 9)} assume !(0 == ~cond); {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {13150#(<= ~counter~0 9)} assume true; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,224 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13150#(<= ~counter~0 9)} {13150#(<= ~counter~0 9)} #55#return; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,225 INFO L290 TraceCheckUtils]: 83: Hoare triple {13150#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13150#(<= ~counter~0 9)} is VALID [2022-04-08 07:59:52,225 INFO L290 TraceCheckUtils]: 84: Hoare triple {13150#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13175#(<= |main_#t~post5| 9)} is VALID [2022-04-08 07:59:52,225 INFO L290 TraceCheckUtils]: 85: Hoare triple {13175#(<= |main_#t~post5| 9)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-08 07:59:52,225 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 07:59:52,225 INFO L290 TraceCheckUtils]: 87: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 07:59:52,225 INFO L290 TraceCheckUtils]: 88: Hoare triple {12909#false} assume !(0 == ~cond); {12909#false} is VALID [2022-04-08 07:59:52,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {12909#false} assume true; {12909#false} is VALID [2022-04-08 07:59:52,226 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12909#false} {12909#false} #57#return; {12909#false} is VALID [2022-04-08 07:59:52,226 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 07:59:52,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 07:59:52,226 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 07:59:52,226 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 07:59:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 07:59:52,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 94: Hoare triple {12909#false} assume !false; {12909#false} is VALID [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 93: Hoare triple {12909#false} assume 0 == ~cond; {12909#false} is VALID [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {12909#false} ~cond := #in~cond; {12909#false} is VALID [2022-04-08 07:59:52,691 INFO L272 TraceCheckUtils]: 91: Hoare triple {12909#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12909#false} is VALID [2022-04-08 07:59:52,691 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12908#true} {12909#false} #57#return; {12909#false} is VALID [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 88: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 87: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,691 INFO L272 TraceCheckUtils]: 86: Hoare triple {12909#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,691 INFO L290 TraceCheckUtils]: 85: Hoare triple {13233#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {12909#false} is VALID [2022-04-08 07:59:52,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {13237#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13233#(< |main_#t~post5| 20)} is VALID [2022-04-08 07:59:52,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {13237#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13237#(< ~counter~0 20)} is VALID [2022-04-08 07:59:52,692 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12908#true} {13237#(< ~counter~0 20)} #55#return; {13237#(< ~counter~0 20)} is VALID [2022-04-08 07:59:52,693 INFO L290 TraceCheckUtils]: 81: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,693 INFO L290 TraceCheckUtils]: 80: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,693 INFO L290 TraceCheckUtils]: 79: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,693 INFO L272 TraceCheckUtils]: 78: Hoare triple {13237#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,693 INFO L290 TraceCheckUtils]: 77: Hoare triple {13237#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-08 07:59:52,694 INFO L290 TraceCheckUtils]: 76: Hoare triple {13262#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13237#(< ~counter~0 20)} is VALID [2022-04-08 07:59:52,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {13262#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13262#(< ~counter~0 19)} is VALID [2022-04-08 07:59:52,694 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12908#true} {13262#(< ~counter~0 19)} #55#return; {13262#(< ~counter~0 19)} is VALID [2022-04-08 07:59:52,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,694 INFO L272 TraceCheckUtils]: 70: Hoare triple {13262#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {13262#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-08 07:59:52,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {13287#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13262#(< ~counter~0 19)} is VALID [2022-04-08 07:59:52,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {13287#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13287#(< ~counter~0 18)} is VALID [2022-04-08 07:59:52,696 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12908#true} {13287#(< ~counter~0 18)} #55#return; {13287#(< ~counter~0 18)} is VALID [2022-04-08 07:59:52,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,696 INFO L272 TraceCheckUtils]: 62: Hoare triple {13287#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {13287#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-08 07:59:52,697 INFO L290 TraceCheckUtils]: 60: Hoare triple {13312#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13287#(< ~counter~0 18)} is VALID [2022-04-08 07:59:52,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {13312#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13312#(< ~counter~0 17)} is VALID [2022-04-08 07:59:52,697 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12908#true} {13312#(< ~counter~0 17)} #55#return; {13312#(< ~counter~0 17)} is VALID [2022-04-08 07:59:52,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,697 INFO L272 TraceCheckUtils]: 54: Hoare triple {13312#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {13312#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-08 07:59:52,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {13337#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13312#(< ~counter~0 17)} is VALID [2022-04-08 07:59:52,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {13337#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13337#(< ~counter~0 16)} is VALID [2022-04-08 07:59:52,699 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12908#true} {13337#(< ~counter~0 16)} #55#return; {13337#(< ~counter~0 16)} is VALID [2022-04-08 07:59:52,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,699 INFO L272 TraceCheckUtils]: 46: Hoare triple {13337#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {13337#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-08 07:59:52,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {13362#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13337#(< ~counter~0 16)} is VALID [2022-04-08 07:59:52,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {13362#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13362#(< ~counter~0 15)} is VALID [2022-04-08 07:59:52,700 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12908#true} {13362#(< ~counter~0 15)} #55#return; {13362#(< ~counter~0 15)} is VALID [2022-04-08 07:59:52,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,701 INFO L272 TraceCheckUtils]: 38: Hoare triple {13362#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {13362#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-08 07:59:52,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {13387#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13362#(< ~counter~0 15)} is VALID [2022-04-08 07:59:52,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {13387#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13387#(< ~counter~0 14)} is VALID [2022-04-08 07:59:52,702 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12908#true} {13387#(< ~counter~0 14)} #55#return; {13387#(< ~counter~0 14)} is VALID [2022-04-08 07:59:52,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,702 INFO L272 TraceCheckUtils]: 30: Hoare triple {13387#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {13387#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-08 07:59:52,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {13412#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13387#(< ~counter~0 14)} is VALID [2022-04-08 07:59:52,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {13412#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13412#(< ~counter~0 13)} is VALID [2022-04-08 07:59:52,703 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12908#true} {13412#(< ~counter~0 13)} #55#return; {13412#(< ~counter~0 13)} is VALID [2022-04-08 07:59:52,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,704 INFO L272 TraceCheckUtils]: 22: Hoare triple {13412#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {13412#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-08 07:59:52,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {13437#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13412#(< ~counter~0 13)} is VALID [2022-04-08 07:59:52,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {13437#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13437#(< ~counter~0 12)} is VALID [2022-04-08 07:59:52,705 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12908#true} {13437#(< ~counter~0 12)} #55#return; {13437#(< ~counter~0 12)} is VALID [2022-04-08 07:59:52,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,705 INFO L272 TraceCheckUtils]: 14: Hoare triple {13437#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-08 07:59:52,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(< ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13437#(< ~counter~0 12)} is VALID [2022-04-08 07:59:52,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(< ~counter~0 11)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12908#true} {13462#(< ~counter~0 11)} #53#return; {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {12908#true} assume true; {12908#true} is VALID [2022-04-08 07:59:52,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {12908#true} assume !(0 == ~cond); {12908#true} is VALID [2022-04-08 07:59:52,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {12908#true} ~cond := #in~cond; {12908#true} is VALID [2022-04-08 07:59:52,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {13462#(< ~counter~0 11)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12908#true} is VALID [2022-04-08 07:59:52,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {13462#(< ~counter~0 11)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {13462#(< ~counter~0 11)} call #t~ret6 := main(); {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13462#(< ~counter~0 11)} {12908#true} #61#return; {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {13462#(< ~counter~0 11)} assume true; {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {12908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13462#(< ~counter~0 11)} is VALID [2022-04-08 07:59:52,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {12908#true} call ULTIMATE.init(); {12908#true} is VALID [2022-04-08 07:59:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 07:59:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:59:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794238761] [2022-04-08 07:59:52,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:59:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153603248] [2022-04-08 07:59:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153603248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:59:52,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:59:52,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 07:59:52,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:59:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1422862756] [2022-04-08 07:59:52,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1422862756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:59:52,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:59:52,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:59:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426883977] [2022-04-08 07:59:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:59:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-08 07:59:52,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:59:52,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:52,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:52,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:59:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:59:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:59:52,783 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:53,155 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-08 07:59:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 07:59:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-08 07:59:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:59:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 07:59:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 07:59:53,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-08 07:59:53,233 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-08 07:59:53,234 INFO L225 Difference]: With dead ends: 110 [2022-04-08 07:59:53,234 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 07:59:53,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 167 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-08 07:59:53,235 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:59:53,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:59:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 07:59:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 07:59:53,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:59:53,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-08 07:59:53,361 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-08 07:59:53,361 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-08 07:59:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:53,362 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 07:59:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 07:59:53,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:53,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:53,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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 100 states. [2022-04-08 07:59:53,363 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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 100 states. [2022-04-08 07:59:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:59:53,364 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 07:59:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 07:59:53,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:59:53,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:59:53,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:59:53,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:59:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 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-08 07:59:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-08 07:59:53,365 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-08 07:59:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:59:53,366 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-08 07:59:53,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:59:53,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-08 07:59:53,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:59:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 07:59:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 07:59:53,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:59:53,606 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:59:53,626 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-08 07:59:53,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 07:59:53,807 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:59:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:59:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-08 07:59:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:59:53,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135529612] [2022-04-08 07:59:53,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:59:53,888 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:59:53,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:59:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-08 07:59:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:59:53,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17687391] [2022-04-08 07:59:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:59:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:59:53,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:59:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238551579] [2022-04-08 07:59:53,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:59:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:59:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:59:53,901 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-08 07:59:53,902 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-08 08:01:01,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 08:01:01,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:01,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 08:01:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:01,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:01,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {14139#true} call ULTIMATE.init(); {14139#true} is VALID [2022-04-08 08:01:01,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {14139#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14139#true} {14139#true} #61#return; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {14139#true} call #t~ret6 := main(); {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {14139#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L272 TraceCheckUtils]: 6: Hoare triple {14139#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14139#true} {14139#true} #53#return; {14139#true} is VALID [2022-04-08 08:01:01,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {14139#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:01,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:01,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:01,918 INFO L272 TraceCheckUtils]: 14: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,918 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14139#true} {14177#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14177#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:01,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {14177#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:01,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:01,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:01,920 INFO L272 TraceCheckUtils]: 22: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,920 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14139#true} {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:01,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {14202#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,921 INFO L272 TraceCheckUtils]: 30: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,922 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14139#true} {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #55#return; {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {14227#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 08:01:01,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 08:01:01,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 08:01:01,923 INFO L272 TraceCheckUtils]: 38: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,923 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14139#true} {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #55#return; {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 08:01:01,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {14252#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:01:01,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:01:01,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:01:01,925 INFO L272 TraceCheckUtils]: 46: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,925 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14139#true} {14277#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14277#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:01:01,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {14277#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:01,926 INFO L290 TraceCheckUtils]: 52: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:01,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:01,926 INFO L272 TraceCheckUtils]: 54: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,927 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14139#true} {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:01,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {14302#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,927 INFO L290 TraceCheckUtils]: 60: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,928 INFO L272 TraceCheckUtils]: 62: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,928 INFO L290 TraceCheckUtils]: 63: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,928 INFO L290 TraceCheckUtils]: 64: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,928 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14139#true} {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:01,929 INFO L290 TraceCheckUtils]: 67: Hoare triple {14327#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:01,929 INFO L290 TraceCheckUtils]: 68: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:01,929 INFO L290 TraceCheckUtils]: 69: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:01,929 INFO L272 TraceCheckUtils]: 70: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,930 INFO L290 TraceCheckUtils]: 71: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,930 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14139#true} {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:01,930 INFO L290 TraceCheckUtils]: 75: Hoare triple {14352#(and (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:01:01,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:01:01,931 INFO L290 TraceCheckUtils]: 77: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:01:01,931 INFO L272 TraceCheckUtils]: 78: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,931 INFO L290 TraceCheckUtils]: 79: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,931 INFO L290 TraceCheckUtils]: 80: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,932 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14139#true} {14377#(and (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14377#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:01:01,932 INFO L290 TraceCheckUtils]: 83: Hoare triple {14377#(and (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:01:01,932 INFO L290 TraceCheckUtils]: 84: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:01:01,933 INFO L290 TraceCheckUtils]: 85: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:01:01,933 INFO L272 TraceCheckUtils]: 86: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,933 INFO L290 TraceCheckUtils]: 87: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,933 INFO L290 TraceCheckUtils]: 88: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,933 INFO L290 TraceCheckUtils]: 89: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,935 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14139#true} {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:01:01,936 INFO L290 TraceCheckUtils]: 91: Hoare triple {14402#(and (= 8 (+ (- 1) main_~y~0)) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 08:01:01,936 INFO L272 TraceCheckUtils]: 92: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14139#true} is VALID [2022-04-08 08:01:01,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {14139#true} ~cond := #in~cond; {14139#true} is VALID [2022-04-08 08:01:01,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {14139#true} assume !(0 == ~cond); {14139#true} is VALID [2022-04-08 08:01:01,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {14139#true} assume true; {14139#true} is VALID [2022-04-08 08:01:01,936 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14139#true} {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 08:01:01,937 INFO L272 TraceCheckUtils]: 97: Hoare triple {14427#(and (= 8 (+ (- 1) main_~y~0)) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:01,937 INFO L290 TraceCheckUtils]: 98: Hoare triple {14446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:01,937 INFO L290 TraceCheckUtils]: 99: Hoare triple {14450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14140#false} is VALID [2022-04-08 08:01:01,937 INFO L290 TraceCheckUtils]: 100: Hoare triple {14140#false} assume !false; {14140#false} is VALID [2022-04-08 08:01:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 08:01:01,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17687391] [2022-04-08 08:01:02,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238551579] [2022-04-08 08:01:02,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238551579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:02,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:02,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 08:01:02,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135529612] [2022-04-08 08:01:02,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135529612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:02,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:01:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935724682] [2022-04-08 08:01:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-08 08:01:02,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:02,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 08:01:02,244 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-08 08:01:02,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:01:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:02,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:01:02,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 08:01:02,245 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 08:01:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:03,388 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-08 08:01:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:01:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-08 08:01:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 08:01:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 08:01:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 08:01:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 08:01:03,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-08 08:01:03,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:03,463 INFO L225 Difference]: With dead ends: 108 [2022-04-08 08:01:03,463 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 08:01:03,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:01:03,464 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:03,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 557 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 08:01:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 08:01:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-08 08:01:03,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:03,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:03,595 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:03,595 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:03,597 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 08:01:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 08:01:03,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:03,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:03,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-08 08:01:03,597 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-08 08:01:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:03,599 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 08:01:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 08:01:03,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:03,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:03,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:03,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-08 08:01:03,602 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-08 08:01:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:03,602 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-08 08:01:03,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 08:01:03,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-08 08:01:03,778 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-08 08:01:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 08:01:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 08:01:03,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:03,779 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:03,831 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-08 08:01:03,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 08:01:03,980 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-08 08:01:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:03,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142705622] [2022-04-08 08:01:04,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:04,057 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:04,057 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-08 08:01:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:04,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313837439] [2022-04-08 08:01:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:04,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:04,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052712129] [2022-04-08 08:01:04,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:01:04,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:04,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:04,072 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-08 08:01:04,072 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-08 08:01:04,720 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 08:01:04,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:04,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 08:01:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:04,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:05,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-08 08:01:05,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15152#(<= ~counter~0 0)} {15144#true} #61#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {15152#(<= ~counter~0 0)} call #t~ret6 := main(); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {15152#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {15152#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {15152#(<= ~counter~0 0)} ~cond := #in~cond; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {15152#(<= ~counter~0 0)} assume !(0 == ~cond); {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {15152#(<= ~counter~0 0)} assume true; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15152#(<= ~counter~0 0)} {15152#(<= ~counter~0 0)} #53#return; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {15152#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15152#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:05,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {15152#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {15186#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,178 INFO L272 TraceCheckUtils]: 14: Hoare triple {15186#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {15186#(<= ~counter~0 1)} ~cond := #in~cond; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {15186#(<= ~counter~0 1)} assume !(0 == ~cond); {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {15186#(<= ~counter~0 1)} assume true; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,180 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15186#(<= ~counter~0 1)} {15186#(<= ~counter~0 1)} #55#return; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {15186#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15186#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:05,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {15186#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {15211#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,181 INFO L272 TraceCheckUtils]: 22: Hoare triple {15211#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {15211#(<= ~counter~0 2)} ~cond := #in~cond; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {15211#(<= ~counter~0 2)} assume !(0 == ~cond); {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {15211#(<= ~counter~0 2)} assume true; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,182 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15211#(<= ~counter~0 2)} {15211#(<= ~counter~0 2)} #55#return; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {15211#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15211#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:05,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {15211#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {15236#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,183 INFO L272 TraceCheckUtils]: 30: Hoare triple {15236#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {15236#(<= ~counter~0 3)} ~cond := #in~cond; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {15236#(<= ~counter~0 3)} assume !(0 == ~cond); {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {15236#(<= ~counter~0 3)} assume true; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,185 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15236#(<= ~counter~0 3)} {15236#(<= ~counter~0 3)} #55#return; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {15236#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15236#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:05,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {15236#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {15261#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,186 INFO L272 TraceCheckUtils]: 38: Hoare triple {15261#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {15261#(<= ~counter~0 4)} ~cond := #in~cond; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {15261#(<= ~counter~0 4)} assume !(0 == ~cond); {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {15261#(<= ~counter~0 4)} assume true; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,187 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15261#(<= ~counter~0 4)} {15261#(<= ~counter~0 4)} #55#return; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {15261#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15261#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:05,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {15261#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {15286#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,188 INFO L272 TraceCheckUtils]: 46: Hoare triple {15286#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {15286#(<= ~counter~0 5)} ~cond := #in~cond; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(<= ~counter~0 5)} assume !(0 == ~cond); {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(<= ~counter~0 5)} assume true; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,189 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15286#(<= ~counter~0 5)} {15286#(<= ~counter~0 5)} #55#return; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,190 INFO L290 TraceCheckUtils]: 51: Hoare triple {15286#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15286#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:05,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {15286#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {15311#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,191 INFO L272 TraceCheckUtils]: 54: Hoare triple {15311#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,191 INFO L290 TraceCheckUtils]: 55: Hoare triple {15311#(<= ~counter~0 6)} ~cond := #in~cond; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {15311#(<= ~counter~0 6)} assume !(0 == ~cond); {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {15311#(<= ~counter~0 6)} assume true; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,192 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15311#(<= ~counter~0 6)} {15311#(<= ~counter~0 6)} #55#return; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,192 INFO L290 TraceCheckUtils]: 59: Hoare triple {15311#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15311#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:05,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {15311#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {15336#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,193 INFO L272 TraceCheckUtils]: 62: Hoare triple {15336#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {15336#(<= ~counter~0 7)} ~cond := #in~cond; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {15336#(<= ~counter~0 7)} assume !(0 == ~cond); {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {15336#(<= ~counter~0 7)} assume true; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,194 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15336#(<= ~counter~0 7)} {15336#(<= ~counter~0 7)} #55#return; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {15336#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15336#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:05,195 INFO L290 TraceCheckUtils]: 68: Hoare triple {15336#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,195 INFO L290 TraceCheckUtils]: 69: Hoare triple {15361#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,196 INFO L272 TraceCheckUtils]: 70: Hoare triple {15361#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {15361#(<= ~counter~0 8)} ~cond := #in~cond; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {15361#(<= ~counter~0 8)} assume !(0 == ~cond); {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {15361#(<= ~counter~0 8)} assume true; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,197 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15361#(<= ~counter~0 8)} {15361#(<= ~counter~0 8)} #55#return; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,197 INFO L290 TraceCheckUtils]: 75: Hoare triple {15361#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15361#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:05,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {15361#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {15386#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,198 INFO L272 TraceCheckUtils]: 78: Hoare triple {15386#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {15386#(<= ~counter~0 9)} ~cond := #in~cond; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,199 INFO L290 TraceCheckUtils]: 80: Hoare triple {15386#(<= ~counter~0 9)} assume !(0 == ~cond); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,199 INFO L290 TraceCheckUtils]: 81: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,199 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15386#(<= ~counter~0 9)} {15386#(<= ~counter~0 9)} #55#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,200 INFO L290 TraceCheckUtils]: 83: Hoare triple {15386#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,200 INFO L290 TraceCheckUtils]: 84: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,200 INFO L290 TraceCheckUtils]: 85: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,201 INFO L272 TraceCheckUtils]: 86: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,201 INFO L290 TraceCheckUtils]: 87: Hoare triple {15411#(<= ~counter~0 10)} ~cond := #in~cond; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,201 INFO L290 TraceCheckUtils]: 88: Hoare triple {15411#(<= ~counter~0 10)} assume !(0 == ~cond); {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,201 INFO L290 TraceCheckUtils]: 89: Hoare triple {15411#(<= ~counter~0 10)} assume true; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,202 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15411#(<= ~counter~0 10)} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,202 INFO L290 TraceCheckUtils]: 91: Hoare triple {15411#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,202 INFO L290 TraceCheckUtils]: 92: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15436#(<= |main_#t~post5| 10)} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {15436#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 95: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {15145#false} assume !(0 == ~cond); {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {15145#false} assume true; {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15145#false} {15145#false} #57#return; {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-08 08:01:05,203 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-08 08:01:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 60 proven. 380 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:01:05,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 102: Hoare triple {15145#false} assume !false; {15145#false} is VALID [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 101: Hoare triple {15145#false} assume 0 == ~cond; {15145#false} is VALID [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 100: Hoare triple {15145#false} ~cond := #in~cond; {15145#false} is VALID [2022-04-08 08:01:05,689 INFO L272 TraceCheckUtils]: 99: Hoare triple {15145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {15145#false} is VALID [2022-04-08 08:01:05,689 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15144#true} {15145#false} #57#return; {15145#false} is VALID [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 97: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 96: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 95: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,689 INFO L272 TraceCheckUtils]: 94: Hoare triple {15145#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,689 INFO L290 TraceCheckUtils]: 93: Hoare triple {15494#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {15145#false} is VALID [2022-04-08 08:01:05,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {15498#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15494#(< |main_#t~post5| 20)} is VALID [2022-04-08 08:01:05,690 INFO L290 TraceCheckUtils]: 91: Hoare triple {15498#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15498#(< ~counter~0 20)} is VALID [2022-04-08 08:01:05,690 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15144#true} {15498#(< ~counter~0 20)} #55#return; {15498#(< ~counter~0 20)} is VALID [2022-04-08 08:01:05,690 INFO L290 TraceCheckUtils]: 89: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,691 INFO L290 TraceCheckUtils]: 88: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,691 INFO L290 TraceCheckUtils]: 87: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,691 INFO L272 TraceCheckUtils]: 86: Hoare triple {15498#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,691 INFO L290 TraceCheckUtils]: 85: Hoare triple {15498#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-08 08:01:05,692 INFO L290 TraceCheckUtils]: 84: Hoare triple {15523#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15498#(< ~counter~0 20)} is VALID [2022-04-08 08:01:05,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {15523#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15523#(< ~counter~0 19)} is VALID [2022-04-08 08:01:05,692 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15144#true} {15523#(< ~counter~0 19)} #55#return; {15523#(< ~counter~0 19)} is VALID [2022-04-08 08:01:05,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,693 INFO L290 TraceCheckUtils]: 79: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,693 INFO L272 TraceCheckUtils]: 78: Hoare triple {15523#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,693 INFO L290 TraceCheckUtils]: 77: Hoare triple {15523#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-08 08:01:05,693 INFO L290 TraceCheckUtils]: 76: Hoare triple {15548#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15523#(< ~counter~0 19)} is VALID [2022-04-08 08:01:05,693 INFO L290 TraceCheckUtils]: 75: Hoare triple {15548#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15548#(< ~counter~0 18)} is VALID [2022-04-08 08:01:05,694 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15144#true} {15548#(< ~counter~0 18)} #55#return; {15548#(< ~counter~0 18)} is VALID [2022-04-08 08:01:05,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,694 INFO L290 TraceCheckUtils]: 71: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,694 INFO L272 TraceCheckUtils]: 70: Hoare triple {15548#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,694 INFO L290 TraceCheckUtils]: 69: Hoare triple {15548#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-08 08:01:05,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {15573#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15548#(< ~counter~0 18)} is VALID [2022-04-08 08:01:05,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {15573#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15573#(< ~counter~0 17)} is VALID [2022-04-08 08:01:05,695 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15144#true} {15573#(< ~counter~0 17)} #55#return; {15573#(< ~counter~0 17)} is VALID [2022-04-08 08:01:05,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,696 INFO L290 TraceCheckUtils]: 63: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,696 INFO L272 TraceCheckUtils]: 62: Hoare triple {15573#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,696 INFO L290 TraceCheckUtils]: 61: Hoare triple {15573#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-08 08:01:05,696 INFO L290 TraceCheckUtils]: 60: Hoare triple {15598#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15573#(< ~counter~0 17)} is VALID [2022-04-08 08:01:05,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {15598#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15598#(< ~counter~0 16)} is VALID [2022-04-08 08:01:05,697 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15144#true} {15598#(< ~counter~0 16)} #55#return; {15598#(< ~counter~0 16)} is VALID [2022-04-08 08:01:05,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,697 INFO L272 TraceCheckUtils]: 54: Hoare triple {15598#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {15598#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-08 08:01:05,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {15623#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15598#(< ~counter~0 16)} is VALID [2022-04-08 08:01:05,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {15623#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15623#(< ~counter~0 15)} is VALID [2022-04-08 08:01:05,699 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15144#true} {15623#(< ~counter~0 15)} #55#return; {15623#(< ~counter~0 15)} is VALID [2022-04-08 08:01:05,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,699 INFO L272 TraceCheckUtils]: 46: Hoare triple {15623#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {15623#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-08 08:01:05,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {15648#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15623#(< ~counter~0 15)} is VALID [2022-04-08 08:01:05,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {15648#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15648#(< ~counter~0 14)} is VALID [2022-04-08 08:01:05,700 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15144#true} {15648#(< ~counter~0 14)} #55#return; {15648#(< ~counter~0 14)} is VALID [2022-04-08 08:01:05,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,701 INFO L272 TraceCheckUtils]: 38: Hoare triple {15648#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {15648#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-08 08:01:05,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {15673#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15648#(< ~counter~0 14)} is VALID [2022-04-08 08:01:05,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {15673#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15673#(< ~counter~0 13)} is VALID [2022-04-08 08:01:05,702 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15144#true} {15673#(< ~counter~0 13)} #55#return; {15673#(< ~counter~0 13)} is VALID [2022-04-08 08:01:05,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,702 INFO L272 TraceCheckUtils]: 30: Hoare triple {15673#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {15673#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-08 08:01:05,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15673#(< ~counter~0 13)} is VALID [2022-04-08 08:01:05,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {15698#(< ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15698#(< ~counter~0 12)} is VALID [2022-04-08 08:01:05,705 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15144#true} {15698#(< ~counter~0 12)} #55#return; {15698#(< ~counter~0 12)} is VALID [2022-04-08 08:01:05,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,705 INFO L272 TraceCheckUtils]: 22: Hoare triple {15698#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-08 08:01:05,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {15411#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15698#(< ~counter~0 12)} is VALID [2022-04-08 08:01:05,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {15411#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,708 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15144#true} {15411#(<= ~counter~0 10)} #55#return; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,708 INFO L272 TraceCheckUtils]: 14: Hoare triple {15411#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {15411#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {15386#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15411#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:05,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {15386#(<= ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15144#true} {15386#(<= ~counter~0 9)} #53#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {15144#true} assume true; {15144#true} is VALID [2022-04-08 08:01:05,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {15144#true} assume !(0 == ~cond); {15144#true} is VALID [2022-04-08 08:01:05,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {15144#true} ~cond := #in~cond; {15144#true} is VALID [2022-04-08 08:01:05,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {15386#(<= ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {15144#true} is VALID [2022-04-08 08:01:05,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {15386#(<= ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {15386#(<= ~counter~0 9)} call #t~ret6 := main(); {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15386#(<= ~counter~0 9)} {15144#true} #61#return; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {15386#(<= ~counter~0 9)} assume true; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {15144#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15386#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:05,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {15144#true} call ULTIMATE.init(); {15144#true} is VALID [2022-04-08 08:01:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 08:01:05,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:05,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313837439] [2022-04-08 08:01:05,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:05,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052712129] [2022-04-08 08:01:05,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052712129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:05,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:05,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 08:01:05,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:05,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142705622] [2022-04-08 08:01:05,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142705622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:05,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:05,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:01:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052993254] [2022-04-08 08:01:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-08 08:01:05,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:05,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:01:05,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:05,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:01:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:01:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 08:01:05,785 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:01:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:06,207 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2022-04-08 08:01:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 08:01:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 103 [2022-04-08 08:01:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:01:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-08 08:01:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:01:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 118 transitions. [2022-04-08 08:01:06,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 118 transitions. [2022-04-08 08:01:06,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:06,301 INFO L225 Difference]: With dead ends: 118 [2022-04-08 08:01:06,301 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 08:01:06,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 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-08 08:01:06,302 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:06,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:01:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 08:01:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-08 08:01:06,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:06,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-08 08:01:06,442 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-08 08:01:06,442 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-08 08:01:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:06,444 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-08 08:01:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 08:01:06,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:06,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:06,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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 108 states. [2022-04-08 08:01:06,444 INFO L87 Difference]: Start difference. First operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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 108 states. [2022-04-08 08:01:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:06,445 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-04-08 08:01:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 08:01:06,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:06,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:06,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:06,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-08 08:01:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2022-04-08 08:01:06,447 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 103 [2022-04-08 08:01:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:06,447 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2022-04-08 08:01:06,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 08:01:06,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 110 transitions. [2022-04-08 08:01:06,779 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-08 08:01:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2022-04-08 08:01:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-08 08:01:06,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:06,780 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:06,799 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-08 08:01:06,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:06,981 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 19 times [2022-04-08 08:01:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:06,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1660081968] [2022-04-08 08:01:07,069 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:07,069 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:07,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:07,069 INFO L85 PathProgramCache]: Analyzing trace with hash -324109488, now seen corresponding path program 20 times [2022-04-08 08:01:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:07,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473699662] [2022-04-08 08:01:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:07,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:07,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539414159] [2022-04-08 08:01:07,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:07,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:07,093 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-08 08:01:07,094 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-08 08:01:07,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:07,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:07,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 08:01:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:08,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:08,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {16473#true} call ULTIMATE.init(); {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {16473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16473#true} {16473#true} #61#return; {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {16473#true} call #t~ret6 := main(); {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {16473#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {16473#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16473#true} {16473#true} #53#return; {16473#true} is VALID [2022-04-08 08:01:08,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {16473#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:08,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:08,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:08,553 INFO L272 TraceCheckUtils]: 14: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,554 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16473#true} {16511#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {16511#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:08,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {16511#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:08,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:08,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:08,555 INFO L272 TraceCheckUtils]: 22: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,556 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16473#true} {16536#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {16536#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:08,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {16536#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 08:01:08,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 08:01:08,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 08:01:08,557 INFO L272 TraceCheckUtils]: 30: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,557 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16473#true} {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #55#return; {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 08:01:08,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {16561#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 08:01:08,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 08:01:08,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 08:01:08,558 INFO L272 TraceCheckUtils]: 38: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,559 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16473#true} {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} #55#return; {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 08:01:08,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {16586#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 08:01:08,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 08:01:08,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 08:01:08,560 INFO L272 TraceCheckUtils]: 46: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,560 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16473#true} {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #55#return; {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 08:01:08,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {16611#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:08,561 INFO L290 TraceCheckUtils]: 52: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:08,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:08,562 INFO L272 TraceCheckUtils]: 54: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,562 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16473#true} {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} #55#return; {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:08,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {16636#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:08,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:08,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:08,563 INFO L272 TraceCheckUtils]: 62: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,565 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16473#true} {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #55#return; {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:08,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {16661#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 08:01:08,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 08:01:08,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 08:01:08,567 INFO L272 TraceCheckUtils]: 70: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,567 INFO L290 TraceCheckUtils]: 71: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,567 INFO L290 TraceCheckUtils]: 72: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,567 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16473#true} {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} #55#return; {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 08:01:08,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {16686#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 08:01:08,568 INFO L290 TraceCheckUtils]: 76: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 08:01:08,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 08:01:08,568 INFO L272 TraceCheckUtils]: 78: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,568 INFO L290 TraceCheckUtils]: 80: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,568 INFO L290 TraceCheckUtils]: 81: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,569 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16473#true} {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} #55#return; {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 08:01:08,569 INFO L290 TraceCheckUtils]: 83: Hoare triple {16711#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 08:01:08,569 INFO L290 TraceCheckUtils]: 84: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 08:01:08,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(#t~post5 < 20);havoc #t~post5; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 08:01:08,570 INFO L272 TraceCheckUtils]: 86: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,570 INFO L290 TraceCheckUtils]: 87: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,570 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16473#true} {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} #55#return; {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 08:01:08,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {16736#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 08:01:08,571 INFO L290 TraceCheckUtils]: 92: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 08:01:08,571 INFO L290 TraceCheckUtils]: 93: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 08:01:08,572 INFO L272 TraceCheckUtils]: 94: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,572 INFO L290 TraceCheckUtils]: 96: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,572 INFO L290 TraceCheckUtils]: 97: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,572 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16473#true} {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} #55#return; {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 08:01:08,573 INFO L290 TraceCheckUtils]: 99: Hoare triple {16761#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 08:01:08,573 INFO L272 TraceCheckUtils]: 100: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {16473#true} is VALID [2022-04-08 08:01:08,573 INFO L290 TraceCheckUtils]: 101: Hoare triple {16473#true} ~cond := #in~cond; {16473#true} is VALID [2022-04-08 08:01:08,573 INFO L290 TraceCheckUtils]: 102: Hoare triple {16473#true} assume !(0 == ~cond); {16473#true} is VALID [2022-04-08 08:01:08,573 INFO L290 TraceCheckUtils]: 103: Hoare triple {16473#true} assume true; {16473#true} is VALID [2022-04-08 08:01:08,574 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {16473#true} {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} #57#return; {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 08:01:08,574 INFO L272 TraceCheckUtils]: 105: Hoare triple {16786#(and (= 5 (+ main_~y~0 (- 5))) (<= main_~k~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:08,574 INFO L290 TraceCheckUtils]: 106: Hoare triple {16805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:08,575 INFO L290 TraceCheckUtils]: 107: Hoare triple {16809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16474#false} is VALID [2022-04-08 08:01:08,575 INFO L290 TraceCheckUtils]: 108: Hoare triple {16474#false} assume !false; {16474#false} is VALID [2022-04-08 08:01:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 24 proven. 220 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 08:01:08,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473699662] [2022-04-08 08:01:08,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539414159] [2022-04-08 08:01:08,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539414159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:08,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:08,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 08:01:08,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1660081968] [2022-04-08 08:01:08,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1660081968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:08,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:08,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:01:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124347806] [2022-04-08 08:01:08,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-08 08:01:08,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:08,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 08:01:08,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:08,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:01:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:01:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:01:08,996 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 08:01:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:10,373 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-08 08:01:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:01:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 109 [2022-04-08 08:01:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 08:01:10,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-08 08:01:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 08:01:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 89 transitions. [2022-04-08 08:01:10,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 89 transitions. [2022-04-08 08:01:10,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:10,446 INFO L225 Difference]: With dead ends: 116 [2022-04-08 08:01:10,446 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 08:01:10,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-08 08:01:10,446 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:10,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 08:01:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 08:01:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-08 08:01:10,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:10,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:10,583 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:10,583 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:10,585 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-08 08:01:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 08:01:10,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:10,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:10,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-08 08:01:10,585 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 110 states. [2022-04-08 08:01:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:10,587 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2022-04-08 08:01:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 08:01:10,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:10,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:10,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:10,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 17 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2022-04-08 08:01:10,589 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 109 [2022-04-08 08:01:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:10,589 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2022-04-08 08:01:10,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 13 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 08:01:10,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 113 transitions. [2022-04-08 08:01:10,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2022-04-08 08:01:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 08:01:10,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:10,798 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:10,803 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-08 08:01:10,998 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:10,999 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 19 times [2022-04-08 08:01:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:10,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344522480] [2022-04-08 08:01:11,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:11,077 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:11,077 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash 509212939, now seen corresponding path program 20 times [2022-04-08 08:01:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866332805] [2022-04-08 08:01:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:11,088 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:11,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543670771] [2022-04-08 08:01:11,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:11,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:11,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:11,089 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:01:11,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 08:01:11,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:11,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:11,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 08:01:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:11,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:11,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-08 08:01:11,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17559#(<= ~counter~0 0)} {17551#true} #61#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {17559#(<= ~counter~0 0)} call #t~ret6 := main(); {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {17559#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {17559#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {17559#(<= ~counter~0 0)} ~cond := #in~cond; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {17559#(<= ~counter~0 0)} assume !(0 == ~cond); {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {17559#(<= ~counter~0 0)} assume true; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17559#(<= ~counter~0 0)} {17559#(<= ~counter~0 0)} #53#return; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {17559#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17559#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:11,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {17559#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {17593#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,652 INFO L272 TraceCheckUtils]: 14: Hoare triple {17593#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {17593#(<= ~counter~0 1)} ~cond := #in~cond; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {17593#(<= ~counter~0 1)} assume !(0 == ~cond); {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {17593#(<= ~counter~0 1)} assume true; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,653 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17593#(<= ~counter~0 1)} {17593#(<= ~counter~0 1)} #55#return; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {17593#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17593#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:11,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {17593#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {17618#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,655 INFO L272 TraceCheckUtils]: 22: Hoare triple {17618#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {17618#(<= ~counter~0 2)} ~cond := #in~cond; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {17618#(<= ~counter~0 2)} assume !(0 == ~cond); {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {17618#(<= ~counter~0 2)} assume true; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,656 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17618#(<= ~counter~0 2)} {17618#(<= ~counter~0 2)} #55#return; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {17618#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17618#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:11,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {17618#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {17643#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,657 INFO L272 TraceCheckUtils]: 30: Hoare triple {17643#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {17643#(<= ~counter~0 3)} ~cond := #in~cond; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {17643#(<= ~counter~0 3)} assume !(0 == ~cond); {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {17643#(<= ~counter~0 3)} assume true; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,658 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17643#(<= ~counter~0 3)} {17643#(<= ~counter~0 3)} #55#return; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {17643#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17643#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:11,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {17643#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {17668#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,660 INFO L272 TraceCheckUtils]: 38: Hoare triple {17668#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {17668#(<= ~counter~0 4)} ~cond := #in~cond; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {17668#(<= ~counter~0 4)} assume !(0 == ~cond); {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {17668#(<= ~counter~0 4)} assume true; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,661 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17668#(<= ~counter~0 4)} {17668#(<= ~counter~0 4)} #55#return; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,661 INFO L290 TraceCheckUtils]: 43: Hoare triple {17668#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17668#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:11,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {17668#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {17693#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,662 INFO L272 TraceCheckUtils]: 46: Hoare triple {17693#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {17693#(<= ~counter~0 5)} ~cond := #in~cond; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {17693#(<= ~counter~0 5)} assume !(0 == ~cond); {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {17693#(<= ~counter~0 5)} assume true; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,663 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17693#(<= ~counter~0 5)} {17693#(<= ~counter~0 5)} #55#return; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {17693#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17693#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:11,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {17693#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {17718#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,665 INFO L272 TraceCheckUtils]: 54: Hoare triple {17718#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {17718#(<= ~counter~0 6)} ~cond := #in~cond; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {17718#(<= ~counter~0 6)} assume !(0 == ~cond); {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {17718#(<= ~counter~0 6)} assume true; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,666 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17718#(<= ~counter~0 6)} {17718#(<= ~counter~0 6)} #55#return; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {17718#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17718#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:11,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {17718#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,667 INFO L290 TraceCheckUtils]: 61: Hoare triple {17743#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,667 INFO L272 TraceCheckUtils]: 62: Hoare triple {17743#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {17743#(<= ~counter~0 7)} ~cond := #in~cond; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {17743#(<= ~counter~0 7)} assume !(0 == ~cond); {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {17743#(<= ~counter~0 7)} assume true; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,668 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17743#(<= ~counter~0 7)} {17743#(<= ~counter~0 7)} #55#return; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {17743#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17743#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:11,669 INFO L290 TraceCheckUtils]: 68: Hoare triple {17743#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {17768#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,669 INFO L272 TraceCheckUtils]: 70: Hoare triple {17768#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {17768#(<= ~counter~0 8)} ~cond := #in~cond; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {17768#(<= ~counter~0 8)} assume !(0 == ~cond); {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,670 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17768#(<= ~counter~0 8)} {17768#(<= ~counter~0 8)} #55#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,671 INFO L290 TraceCheckUtils]: 75: Hoare triple {17768#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:11,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,672 INFO L272 TraceCheckUtils]: 78: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,672 INFO L290 TraceCheckUtils]: 79: Hoare triple {17793#(<= ~counter~0 9)} ~cond := #in~cond; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,672 INFO L290 TraceCheckUtils]: 80: Hoare triple {17793#(<= ~counter~0 9)} assume !(0 == ~cond); {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,673 INFO L290 TraceCheckUtils]: 81: Hoare triple {17793#(<= ~counter~0 9)} assume true; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,673 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17793#(<= ~counter~0 9)} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,673 INFO L290 TraceCheckUtils]: 83: Hoare triple {17793#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:11,674 INFO L290 TraceCheckUtils]: 84: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,674 INFO L290 TraceCheckUtils]: 85: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,674 INFO L272 TraceCheckUtils]: 86: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,674 INFO L290 TraceCheckUtils]: 87: Hoare triple {17818#(<= ~counter~0 10)} ~cond := #in~cond; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,675 INFO L290 TraceCheckUtils]: 88: Hoare triple {17818#(<= ~counter~0 10)} assume !(0 == ~cond); {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,675 INFO L290 TraceCheckUtils]: 89: Hoare triple {17818#(<= ~counter~0 10)} assume true; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,675 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17818#(<= ~counter~0 10)} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,676 INFO L290 TraceCheckUtils]: 91: Hoare triple {17818#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:11,676 INFO L290 TraceCheckUtils]: 92: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,677 INFO L272 TraceCheckUtils]: 94: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,677 INFO L290 TraceCheckUtils]: 95: Hoare triple {17843#(<= ~counter~0 11)} ~cond := #in~cond; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,677 INFO L290 TraceCheckUtils]: 96: Hoare triple {17843#(<= ~counter~0 11)} assume !(0 == ~cond); {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,677 INFO L290 TraceCheckUtils]: 97: Hoare triple {17843#(<= ~counter~0 11)} assume true; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,678 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17843#(<= ~counter~0 11)} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,678 INFO L290 TraceCheckUtils]: 99: Hoare triple {17843#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:11,678 INFO L290 TraceCheckUtils]: 100: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17868#(<= |main_#t~post5| 11)} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {17868#(<= |main_#t~post5| 11)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 103: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 104: Hoare triple {17552#false} assume !(0 == ~cond); {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 105: Hoare triple {17552#false} assume true; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17552#false} {17552#false} #57#return; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-08 08:01:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 66 proven. 462 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:01:11,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:12,202 INFO L290 TraceCheckUtils]: 110: Hoare triple {17552#false} assume !false; {17552#false} is VALID [2022-04-08 08:01:12,203 INFO L290 TraceCheckUtils]: 109: Hoare triple {17552#false} assume 0 == ~cond; {17552#false} is VALID [2022-04-08 08:01:12,203 INFO L290 TraceCheckUtils]: 108: Hoare triple {17552#false} ~cond := #in~cond; {17552#false} is VALID [2022-04-08 08:01:12,203 INFO L272 TraceCheckUtils]: 107: Hoare triple {17552#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {17552#false} is VALID [2022-04-08 08:01:12,203 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17551#true} {17552#false} #57#return; {17552#false} is VALID [2022-04-08 08:01:12,203 INFO L290 TraceCheckUtils]: 105: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,203 INFO L290 TraceCheckUtils]: 104: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,203 INFO L290 TraceCheckUtils]: 103: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,203 INFO L272 TraceCheckUtils]: 102: Hoare triple {17552#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,203 INFO L290 TraceCheckUtils]: 101: Hoare triple {17926#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {17552#false} is VALID [2022-04-08 08:01:12,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {17930#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17926#(< |main_#t~post5| 20)} is VALID [2022-04-08 08:01:12,204 INFO L290 TraceCheckUtils]: 99: Hoare triple {17930#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17930#(< ~counter~0 20)} is VALID [2022-04-08 08:01:12,204 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17551#true} {17930#(< ~counter~0 20)} #55#return; {17930#(< ~counter~0 20)} is VALID [2022-04-08 08:01:12,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,204 INFO L290 TraceCheckUtils]: 96: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,204 INFO L290 TraceCheckUtils]: 95: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,205 INFO L272 TraceCheckUtils]: 94: Hoare triple {17930#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,206 INFO L290 TraceCheckUtils]: 93: Hoare triple {17930#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-08 08:01:12,206 INFO L290 TraceCheckUtils]: 92: Hoare triple {17955#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17930#(< ~counter~0 20)} is VALID [2022-04-08 08:01:12,207 INFO L290 TraceCheckUtils]: 91: Hoare triple {17955#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17955#(< ~counter~0 19)} is VALID [2022-04-08 08:01:12,207 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17551#true} {17955#(< ~counter~0 19)} #55#return; {17955#(< ~counter~0 19)} is VALID [2022-04-08 08:01:12,207 INFO L290 TraceCheckUtils]: 89: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,207 INFO L290 TraceCheckUtils]: 88: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,207 INFO L272 TraceCheckUtils]: 86: Hoare triple {17955#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,208 INFO L290 TraceCheckUtils]: 85: Hoare triple {17955#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-08 08:01:12,208 INFO L290 TraceCheckUtils]: 84: Hoare triple {17980#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17955#(< ~counter~0 19)} is VALID [2022-04-08 08:01:12,209 INFO L290 TraceCheckUtils]: 83: Hoare triple {17980#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17980#(< ~counter~0 18)} is VALID [2022-04-08 08:01:12,209 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17551#true} {17980#(< ~counter~0 18)} #55#return; {17980#(< ~counter~0 18)} is VALID [2022-04-08 08:01:12,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,209 INFO L290 TraceCheckUtils]: 80: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,209 INFO L290 TraceCheckUtils]: 79: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,209 INFO L272 TraceCheckUtils]: 78: Hoare triple {17980#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {17980#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-08 08:01:12,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {18005#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17980#(< ~counter~0 18)} is VALID [2022-04-08 08:01:12,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {18005#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18005#(< ~counter~0 17)} is VALID [2022-04-08 08:01:12,211 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17551#true} {18005#(< ~counter~0 17)} #55#return; {18005#(< ~counter~0 17)} is VALID [2022-04-08 08:01:12,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,211 INFO L272 TraceCheckUtils]: 70: Hoare triple {18005#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,211 INFO L290 TraceCheckUtils]: 69: Hoare triple {18005#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-08 08:01:12,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {18030#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18005#(< ~counter~0 17)} is VALID [2022-04-08 08:01:12,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {18030#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18030#(< ~counter~0 16)} is VALID [2022-04-08 08:01:12,212 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {17551#true} {18030#(< ~counter~0 16)} #55#return; {18030#(< ~counter~0 16)} is VALID [2022-04-08 08:01:12,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,212 INFO L272 TraceCheckUtils]: 62: Hoare triple {18030#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {18030#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-08 08:01:12,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {18055#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18030#(< ~counter~0 16)} is VALID [2022-04-08 08:01:12,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {18055#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18055#(< ~counter~0 15)} is VALID [2022-04-08 08:01:12,214 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {17551#true} {18055#(< ~counter~0 15)} #55#return; {18055#(< ~counter~0 15)} is VALID [2022-04-08 08:01:12,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,214 INFO L272 TraceCheckUtils]: 54: Hoare triple {18055#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {18055#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-08 08:01:12,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {18080#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18055#(< ~counter~0 15)} is VALID [2022-04-08 08:01:12,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {18080#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18080#(< ~counter~0 14)} is VALID [2022-04-08 08:01:12,215 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17551#true} {18080#(< ~counter~0 14)} #55#return; {18080#(< ~counter~0 14)} is VALID [2022-04-08 08:01:12,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,216 INFO L272 TraceCheckUtils]: 46: Hoare triple {18080#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {18080#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-08 08:01:12,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {18105#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18080#(< ~counter~0 14)} is VALID [2022-04-08 08:01:12,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {18105#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {18105#(< ~counter~0 13)} is VALID [2022-04-08 08:01:12,217 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17551#true} {18105#(< ~counter~0 13)} #55#return; {18105#(< ~counter~0 13)} is VALID [2022-04-08 08:01:12,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,217 INFO L272 TraceCheckUtils]: 38: Hoare triple {18105#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {18105#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-08 08:01:12,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {17843#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18105#(< ~counter~0 13)} is VALID [2022-04-08 08:01:12,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {17843#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:12,219 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17551#true} {17843#(<= ~counter~0 11)} #55#return; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:12,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,219 INFO L272 TraceCheckUtils]: 30: Hoare triple {17843#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {17843#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:12,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {17818#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17843#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:12,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {17818#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:12,220 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17551#true} {17818#(<= ~counter~0 10)} #55#return; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:12,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,220 INFO L272 TraceCheckUtils]: 22: Hoare triple {17818#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {17818#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:12,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {17793#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17818#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:12,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {17793#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:12,222 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17551#true} {17793#(<= ~counter~0 9)} #55#return; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:12,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,222 INFO L272 TraceCheckUtils]: 14: Hoare triple {17793#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {17793#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:12,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {17768#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17793#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:12,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {17768#(<= ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17551#true} {17768#(<= ~counter~0 8)} #53#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {17551#true} assume true; {17551#true} is VALID [2022-04-08 08:01:12,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {17551#true} assume !(0 == ~cond); {17551#true} is VALID [2022-04-08 08:01:12,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {17551#true} ~cond := #in~cond; {17551#true} is VALID [2022-04-08 08:01:12,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {17768#(<= ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {17551#true} is VALID [2022-04-08 08:01:12,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {17768#(<= ~counter~0 8)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {17768#(<= ~counter~0 8)} call #t~ret6 := main(); {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17768#(<= ~counter~0 8)} {17551#true} #61#return; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {17768#(<= ~counter~0 8)} assume true; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {17551#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17768#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:12,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {17551#true} call ULTIMATE.init(); {17551#true} is VALID [2022-04-08 08:01:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 08:01:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:12,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866332805] [2022-04-08 08:01:12,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:12,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543670771] [2022-04-08 08:01:12,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543670771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:12,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:12,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 08:01:12,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:12,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344522480] [2022-04-08 08:01:12,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344522480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:12,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:12,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:01:12,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094717079] [2022-04-08 08:01:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:12,227 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-08 08:01:12,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:12,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:12,304 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-08 08:01:12,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:01:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:01:12,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 08:01:12,305 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:12,731 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2022-04-08 08:01:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 08:01:12,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 111 [2022-04-08 08:01:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-08 08:01:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 126 transitions. [2022-04-08 08:01:12,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 126 transitions. [2022-04-08 08:01:12,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:12,835 INFO L225 Difference]: With dead ends: 126 [2022-04-08 08:01:12,835 INFO L226 Difference]: Without dead ends: 116 [2022-04-08 08:01:12,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 08:01:12,836 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:12,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:01:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-08 08:01:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-08 08:01:12,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:12,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 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-08 08:01:12,997 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 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-08 08:01:12,998 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 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-08 08:01:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:12,999 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-08 08:01:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 08:01:13,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:13,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:13,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 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 116 states. [2022-04-08 08:01:13,000 INFO L87 Difference]: Start difference. First operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 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 116 states. [2022-04-08 08:01:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:13,001 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-04-08 08:01:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 08:01:13,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:13,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:13,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:13,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 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-08 08:01:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2022-04-08 08:01:13,003 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 111 [2022-04-08 08:01:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:13,004 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2022-04-08 08:01:13,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 08:01:13,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 118 transitions. [2022-04-08 08:01:13,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2022-04-08 08:01:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 08:01:13,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:13,254 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:13,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 08:01:13,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 08:01:13,455 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 21 times [2022-04-08 08:01:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:13,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1327810461] [2022-04-08 08:01:13,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:13,545 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:13,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 988557105, now seen corresponding path program 22 times [2022-04-08 08:01:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:13,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856844249] [2022-04-08 08:01:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:13,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:13,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112026414] [2022-04-08 08:01:13,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:01:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:13,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:13,559 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:01:13,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 08:01:13,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:01:13,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:13,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 08:01:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:13,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:14,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {18978#true} call ULTIMATE.init(); {18978#true} is VALID [2022-04-08 08:01:14,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {18978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18978#true} is VALID [2022-04-08 08:01:14,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18978#true} {18978#true} #61#return; {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {18978#true} call #t~ret6 := main(); {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {18978#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {18978#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18978#true} {18978#true} #53#return; {18978#true} is VALID [2022-04-08 08:01:14,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {18978#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:14,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:14,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:14,190 INFO L272 TraceCheckUtils]: 14: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,190 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18978#true} {19016#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {19016#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:14,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {19016#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:01:14,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:01:14,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:01:14,191 INFO L272 TraceCheckUtils]: 22: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,192 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18978#true} {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:01:14,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {19041#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:14,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:14,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:14,193 INFO L272 TraceCheckUtils]: 30: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,194 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18978#true} {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:14,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {19066#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 08:01:14,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 08:01:14,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 08:01:14,195 INFO L272 TraceCheckUtils]: 38: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,195 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18978#true} {19091#(and (= main_~y~0 3) (= main_~c~0 3))} #55#return; {19091#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 08:01:14,196 INFO L290 TraceCheckUtils]: 43: Hoare triple {19091#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:14,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:14,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:14,196 INFO L272 TraceCheckUtils]: 46: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,197 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18978#true} {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:14,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {19116#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:14,198 INFO L290 TraceCheckUtils]: 52: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:14,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:14,198 INFO L272 TraceCheckUtils]: 54: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,198 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18978#true} {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:01:14,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {19141#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:14,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:14,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:14,200 INFO L272 TraceCheckUtils]: 62: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,200 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18978#true} {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #55#return; {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:01:14,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {19166#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:14,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:14,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:14,201 INFO L272 TraceCheckUtils]: 70: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,202 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18978#true} {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:14,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {19191#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 08:01:14,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 08:01:14,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(#t~post5 < 20);havoc #t~post5; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 08:01:14,203 INFO L272 TraceCheckUtils]: 78: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,203 INFO L290 TraceCheckUtils]: 79: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,203 INFO L290 TraceCheckUtils]: 80: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,203 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {18978#true} {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} #55#return; {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} is VALID [2022-04-08 08:01:14,204 INFO L290 TraceCheckUtils]: 83: Hoare triple {19216#(and (= 7 (+ (- 1) main_~c~0)) (= (+ (- 2) main_~y~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 08:01:14,204 INFO L290 TraceCheckUtils]: 84: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 08:01:14,204 INFO L290 TraceCheckUtils]: 85: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 08:01:14,204 INFO L272 TraceCheckUtils]: 86: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,204 INFO L290 TraceCheckUtils]: 87: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,204 INFO L290 TraceCheckUtils]: 88: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,204 INFO L290 TraceCheckUtils]: 89: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,205 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {18978#true} {19241#(and (= main_~y~0 9) (= main_~c~0 9))} #55#return; {19241#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 08:01:14,205 INFO L290 TraceCheckUtils]: 91: Hoare triple {19241#(and (= main_~y~0 9) (= main_~c~0 9))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 08:01:14,206 INFO L290 TraceCheckUtils]: 92: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 08:01:14,206 INFO L290 TraceCheckUtils]: 93: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(#t~post5 < 20);havoc #t~post5; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 08:01:14,206 INFO L272 TraceCheckUtils]: 94: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,206 INFO L290 TraceCheckUtils]: 95: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,206 INFO L290 TraceCheckUtils]: 96: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,206 INFO L290 TraceCheckUtils]: 97: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,206 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {18978#true} {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} #55#return; {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} is VALID [2022-04-08 08:01:14,209 INFO L290 TraceCheckUtils]: 99: Hoare triple {19266#(and (= 9 (+ (- 1) main_~y~0)) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 08:01:14,209 INFO L290 TraceCheckUtils]: 100: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 08:01:14,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !!(#t~post5 < 20);havoc #t~post5; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 08:01:14,210 INFO L272 TraceCheckUtils]: 102: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,210 INFO L290 TraceCheckUtils]: 103: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,210 INFO L290 TraceCheckUtils]: 104: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,210 INFO L290 TraceCheckUtils]: 105: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,210 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {18978#true} {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} #55#return; {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} is VALID [2022-04-08 08:01:14,211 INFO L290 TraceCheckUtils]: 107: Hoare triple {19291#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9))} assume !(~c~0 < ~k~0); {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-08 08:01:14,211 INFO L272 TraceCheckUtils]: 108: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {18978#true} is VALID [2022-04-08 08:01:14,211 INFO L290 TraceCheckUtils]: 109: Hoare triple {18978#true} ~cond := #in~cond; {18978#true} is VALID [2022-04-08 08:01:14,211 INFO L290 TraceCheckUtils]: 110: Hoare triple {18978#true} assume !(0 == ~cond); {18978#true} is VALID [2022-04-08 08:01:14,211 INFO L290 TraceCheckUtils]: 111: Hoare triple {18978#true} assume true; {18978#true} is VALID [2022-04-08 08:01:14,212 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {18978#true} {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} #57#return; {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} is VALID [2022-04-08 08:01:14,212 INFO L272 TraceCheckUtils]: 113: Hoare triple {19316#(and (< 10 main_~k~0) (= (+ (- 2) main_~y~0) 9) (<= main_~k~0 11))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:14,212 INFO L290 TraceCheckUtils]: 114: Hoare triple {19335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:14,213 INFO L290 TraceCheckUtils]: 115: Hoare triple {19339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18979#false} is VALID [2022-04-08 08:01:14,213 INFO L290 TraceCheckUtils]: 116: Hoare triple {18979#false} assume !false; {18979#false} is VALID [2022-04-08 08:01:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 26 proven. 264 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 08:01:14,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:14,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856844249] [2022-04-08 08:01:14,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:14,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112026414] [2022-04-08 08:01:14,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112026414] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:14,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:14,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 08:01:14,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:14,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1327810461] [2022-04-08 08:01:14,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1327810461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:14,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:14,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 08:01:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691970304] [2022-04-08 08:01:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-08 08:01:14,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:14,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 08:01:14,532 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-08 08:01:14,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 08:01:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:14,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 08:01:14,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:01:14,533 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 08:01:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:16,129 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-08 08:01:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 08:01:16,129 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 117 [2022-04-08 08:01:16,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 08:01:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-08 08:01:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 08:01:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 94 transitions. [2022-04-08 08:01:16,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 94 transitions. [2022-04-08 08:01:16,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:16,203 INFO L225 Difference]: With dead ends: 124 [2022-04-08 08:01:16,203 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 08:01:16,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 08:01:16,204 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:16,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 703 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 08:01:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 08:01:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 08:01:16,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:16,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 08:01:16,351 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 08:01:16,351 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 08:01:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:16,353 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-08 08:01:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 08:01:16,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:16,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:16,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 08:01:16,353 INFO L87 Difference]: Start difference. First operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-08 08:01:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:16,354 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-08 08:01:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 08:01:16,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:16,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:16,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:16,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 18 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 08:01:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-08 08:01:16,356 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 117 [2022-04-08 08:01:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:16,356 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-08 08:01:16,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 14 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 08:01:16,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-08 08:01:16,649 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-08 08:01:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-08 08:01:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 08:01:16,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:16,650 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:16,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 08:01:16,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 08:01:16,851 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:16,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 21 times [2022-04-08 08:01:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [322699634] [2022-04-08 08:01:16,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:16,936 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:16,936 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash -738576212, now seen corresponding path program 22 times [2022-04-08 08:01:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480118043] [2022-04-08 08:01:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:16,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:16,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906866530] [2022-04-08 08:01:16,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:01:16,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:16,949 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:01:16,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 08:01:17,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:01:17,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:17,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 08:01:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:17,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:17,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-08 08:01:17,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20137#(<= ~counter~0 0)} {20129#true} #61#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {20137#(<= ~counter~0 0)} call #t~ret6 := main(); {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {20137#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,593 INFO L272 TraceCheckUtils]: 6: Hoare triple {20137#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {20137#(<= ~counter~0 0)} ~cond := #in~cond; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {20137#(<= ~counter~0 0)} assume !(0 == ~cond); {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {20137#(<= ~counter~0 0)} assume true; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20137#(<= ~counter~0 0)} {20137#(<= ~counter~0 0)} #53#return; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {20137#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20137#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:17,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {20137#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {20171#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,596 INFO L272 TraceCheckUtils]: 14: Hoare triple {20171#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {20171#(<= ~counter~0 1)} ~cond := #in~cond; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {20171#(<= ~counter~0 1)} assume !(0 == ~cond); {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {20171#(<= ~counter~0 1)} assume true; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,597 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20171#(<= ~counter~0 1)} {20171#(<= ~counter~0 1)} #55#return; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {20171#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20171#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:17,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {20171#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {20196#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,598 INFO L272 TraceCheckUtils]: 22: Hoare triple {20196#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {20196#(<= ~counter~0 2)} ~cond := #in~cond; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {20196#(<= ~counter~0 2)} assume !(0 == ~cond); {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {20196#(<= ~counter~0 2)} assume true; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,599 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20196#(<= ~counter~0 2)} {20196#(<= ~counter~0 2)} #55#return; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {20196#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20196#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:17,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {20196#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {20221#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,601 INFO L272 TraceCheckUtils]: 30: Hoare triple {20221#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {20221#(<= ~counter~0 3)} ~cond := #in~cond; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {20221#(<= ~counter~0 3)} assume !(0 == ~cond); {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {20221#(<= ~counter~0 3)} assume true; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,602 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20221#(<= ~counter~0 3)} {20221#(<= ~counter~0 3)} #55#return; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {20221#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20221#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:17,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {20221#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {20246#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,603 INFO L272 TraceCheckUtils]: 38: Hoare triple {20246#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {20246#(<= ~counter~0 4)} ~cond := #in~cond; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {20246#(<= ~counter~0 4)} assume !(0 == ~cond); {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {20246#(<= ~counter~0 4)} assume true; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,604 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20246#(<= ~counter~0 4)} {20246#(<= ~counter~0 4)} #55#return; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {20246#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20246#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:17,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {20246#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {20271#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,606 INFO L272 TraceCheckUtils]: 46: Hoare triple {20271#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {20271#(<= ~counter~0 5)} ~cond := #in~cond; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {20271#(<= ~counter~0 5)} assume !(0 == ~cond); {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {20271#(<= ~counter~0 5)} assume true; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,607 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20271#(<= ~counter~0 5)} {20271#(<= ~counter~0 5)} #55#return; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {20271#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20271#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:17,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {20271#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {20296#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,608 INFO L272 TraceCheckUtils]: 54: Hoare triple {20296#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {20296#(<= ~counter~0 6)} ~cond := #in~cond; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {20296#(<= ~counter~0 6)} assume !(0 == ~cond); {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {20296#(<= ~counter~0 6)} assume true; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,609 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20296#(<= ~counter~0 6)} {20296#(<= ~counter~0 6)} #55#return; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,609 INFO L290 TraceCheckUtils]: 59: Hoare triple {20296#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20296#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:17,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {20296#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {20321#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,611 INFO L272 TraceCheckUtils]: 62: Hoare triple {20321#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,611 INFO L290 TraceCheckUtils]: 63: Hoare triple {20321#(<= ~counter~0 7)} ~cond := #in~cond; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,611 INFO L290 TraceCheckUtils]: 64: Hoare triple {20321#(<= ~counter~0 7)} assume !(0 == ~cond); {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,611 INFO L290 TraceCheckUtils]: 65: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,612 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20321#(<= ~counter~0 7)} {20321#(<= ~counter~0 7)} #55#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,612 INFO L290 TraceCheckUtils]: 67: Hoare triple {20321#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:17,612 INFO L290 TraceCheckUtils]: 68: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,613 INFO L290 TraceCheckUtils]: 69: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,613 INFO L272 TraceCheckUtils]: 70: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {20346#(<= ~counter~0 8)} ~cond := #in~cond; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {20346#(<= ~counter~0 8)} assume !(0 == ~cond); {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,614 INFO L290 TraceCheckUtils]: 73: Hoare triple {20346#(<= ~counter~0 8)} assume true; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,614 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20346#(<= ~counter~0 8)} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,614 INFO L290 TraceCheckUtils]: 75: Hoare triple {20346#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:17,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,615 INFO L272 TraceCheckUtils]: 78: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {20371#(<= ~counter~0 9)} ~cond := #in~cond; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {20371#(<= ~counter~0 9)} assume !(0 == ~cond); {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,616 INFO L290 TraceCheckUtils]: 81: Hoare triple {20371#(<= ~counter~0 9)} assume true; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,616 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20371#(<= ~counter~0 9)} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,617 INFO L290 TraceCheckUtils]: 83: Hoare triple {20371#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:17,617 INFO L290 TraceCheckUtils]: 84: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,617 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,618 INFO L272 TraceCheckUtils]: 86: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,618 INFO L290 TraceCheckUtils]: 87: Hoare triple {20396#(<= ~counter~0 10)} ~cond := #in~cond; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,618 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#(<= ~counter~0 10)} assume !(0 == ~cond); {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,618 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#(<= ~counter~0 10)} assume true; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,619 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20396#(<= ~counter~0 10)} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,619 INFO L290 TraceCheckUtils]: 91: Hoare triple {20396#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:17,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,620 INFO L290 TraceCheckUtils]: 93: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,620 INFO L272 TraceCheckUtils]: 94: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,620 INFO L290 TraceCheckUtils]: 95: Hoare triple {20421#(<= ~counter~0 11)} ~cond := #in~cond; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {20421#(<= ~counter~0 11)} assume !(0 == ~cond); {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {20421#(<= ~counter~0 11)} assume true; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,621 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20421#(<= ~counter~0 11)} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,622 INFO L290 TraceCheckUtils]: 99: Hoare triple {20421#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:17,622 INFO L290 TraceCheckUtils]: 100: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,622 INFO L290 TraceCheckUtils]: 101: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,623 INFO L272 TraceCheckUtils]: 102: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,623 INFO L290 TraceCheckUtils]: 103: Hoare triple {20446#(<= ~counter~0 12)} ~cond := #in~cond; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,623 INFO L290 TraceCheckUtils]: 104: Hoare triple {20446#(<= ~counter~0 12)} assume !(0 == ~cond); {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,623 INFO L290 TraceCheckUtils]: 105: Hoare triple {20446#(<= ~counter~0 12)} assume true; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,624 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20446#(<= ~counter~0 12)} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,624 INFO L290 TraceCheckUtils]: 107: Hoare triple {20446#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:17,624 INFO L290 TraceCheckUtils]: 108: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20471#(<= |main_#t~post5| 12)} is VALID [2022-04-08 08:01:17,624 INFO L290 TraceCheckUtils]: 109: Hoare triple {20471#(<= |main_#t~post5| 12)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L290 TraceCheckUtils]: 111: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L290 TraceCheckUtils]: 112: Hoare triple {20130#false} assume !(0 == ~cond); {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L290 TraceCheckUtils]: 113: Hoare triple {20130#false} assume true; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20130#false} {20130#false} #57#return; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-08 08:01:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 72 proven. 552 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 08:01:17,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:18,165 INFO L290 TraceCheckUtils]: 118: Hoare triple {20130#false} assume !false; {20130#false} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 117: Hoare triple {20130#false} assume 0 == ~cond; {20130#false} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 116: Hoare triple {20130#false} ~cond := #in~cond; {20130#false} is VALID [2022-04-08 08:01:18,166 INFO L272 TraceCheckUtils]: 115: Hoare triple {20130#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {20130#false} is VALID [2022-04-08 08:01:18,166 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20129#true} {20130#false} #57#return; {20130#false} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 113: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 112: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 111: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,166 INFO L272 TraceCheckUtils]: 110: Hoare triple {20130#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 109: Hoare triple {20529#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {20130#false} is VALID [2022-04-08 08:01:18,166 INFO L290 TraceCheckUtils]: 108: Hoare triple {20533#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20529#(< |main_#t~post5| 20)} is VALID [2022-04-08 08:01:18,167 INFO L290 TraceCheckUtils]: 107: Hoare triple {20533#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20533#(< ~counter~0 20)} is VALID [2022-04-08 08:01:18,167 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20129#true} {20533#(< ~counter~0 20)} #55#return; {20533#(< ~counter~0 20)} is VALID [2022-04-08 08:01:18,167 INFO L290 TraceCheckUtils]: 105: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,167 INFO L290 TraceCheckUtils]: 104: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,167 INFO L290 TraceCheckUtils]: 103: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,167 INFO L272 TraceCheckUtils]: 102: Hoare triple {20533#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,168 INFO L290 TraceCheckUtils]: 101: Hoare triple {20533#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-08 08:01:18,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {20558#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20533#(< ~counter~0 20)} is VALID [2022-04-08 08:01:18,169 INFO L290 TraceCheckUtils]: 99: Hoare triple {20558#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20558#(< ~counter~0 19)} is VALID [2022-04-08 08:01:18,169 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20129#true} {20558#(< ~counter~0 19)} #55#return; {20558#(< ~counter~0 19)} is VALID [2022-04-08 08:01:18,169 INFO L290 TraceCheckUtils]: 97: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,169 INFO L290 TraceCheckUtils]: 96: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,169 INFO L290 TraceCheckUtils]: 95: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,169 INFO L272 TraceCheckUtils]: 94: Hoare triple {20558#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,170 INFO L290 TraceCheckUtils]: 93: Hoare triple {20558#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-08 08:01:18,170 INFO L290 TraceCheckUtils]: 92: Hoare triple {20583#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20558#(< ~counter~0 19)} is VALID [2022-04-08 08:01:18,170 INFO L290 TraceCheckUtils]: 91: Hoare triple {20583#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20583#(< ~counter~0 18)} is VALID [2022-04-08 08:01:18,171 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20129#true} {20583#(< ~counter~0 18)} #55#return; {20583#(< ~counter~0 18)} is VALID [2022-04-08 08:01:18,171 INFO L290 TraceCheckUtils]: 89: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,171 INFO L290 TraceCheckUtils]: 88: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,171 INFO L290 TraceCheckUtils]: 87: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,171 INFO L272 TraceCheckUtils]: 86: Hoare triple {20583#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,171 INFO L290 TraceCheckUtils]: 85: Hoare triple {20583#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-08 08:01:18,172 INFO L290 TraceCheckUtils]: 84: Hoare triple {20608#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20583#(< ~counter~0 18)} is VALID [2022-04-08 08:01:18,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {20608#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20608#(< ~counter~0 17)} is VALID [2022-04-08 08:01:18,172 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20129#true} {20608#(< ~counter~0 17)} #55#return; {20608#(< ~counter~0 17)} is VALID [2022-04-08 08:01:18,172 INFO L290 TraceCheckUtils]: 81: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,172 INFO L290 TraceCheckUtils]: 80: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,173 INFO L272 TraceCheckUtils]: 78: Hoare triple {20608#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {20608#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-08 08:01:18,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {20633#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20608#(< ~counter~0 17)} is VALID [2022-04-08 08:01:18,174 INFO L290 TraceCheckUtils]: 75: Hoare triple {20633#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20633#(< ~counter~0 16)} is VALID [2022-04-08 08:01:18,174 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20129#true} {20633#(< ~counter~0 16)} #55#return; {20633#(< ~counter~0 16)} is VALID [2022-04-08 08:01:18,174 INFO L290 TraceCheckUtils]: 73: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,174 INFO L290 TraceCheckUtils]: 72: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,174 INFO L290 TraceCheckUtils]: 71: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,174 INFO L272 TraceCheckUtils]: 70: Hoare triple {20633#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,175 INFO L290 TraceCheckUtils]: 69: Hoare triple {20633#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-08 08:01:18,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {20658#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20633#(< ~counter~0 16)} is VALID [2022-04-08 08:01:18,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {20658#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20658#(< ~counter~0 15)} is VALID [2022-04-08 08:01:18,176 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20129#true} {20658#(< ~counter~0 15)} #55#return; {20658#(< ~counter~0 15)} is VALID [2022-04-08 08:01:18,176 INFO L290 TraceCheckUtils]: 65: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,177 INFO L272 TraceCheckUtils]: 62: Hoare triple {20658#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {20658#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-08 08:01:18,177 INFO L290 TraceCheckUtils]: 60: Hoare triple {20683#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20658#(< ~counter~0 15)} is VALID [2022-04-08 08:01:18,178 INFO L290 TraceCheckUtils]: 59: Hoare triple {20683#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20683#(< ~counter~0 14)} is VALID [2022-04-08 08:01:18,178 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20129#true} {20683#(< ~counter~0 14)} #55#return; {20683#(< ~counter~0 14)} is VALID [2022-04-08 08:01:18,178 INFO L290 TraceCheckUtils]: 57: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,179 INFO L272 TraceCheckUtils]: 54: Hoare triple {20683#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {20683#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-08 08:01:18,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {20446#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20683#(< ~counter~0 14)} is VALID [2022-04-08 08:01:18,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {20446#(<= ~counter~0 12)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:18,180 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20129#true} {20446#(<= ~counter~0 12)} #55#return; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:18,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,180 INFO L272 TraceCheckUtils]: 46: Hoare triple {20446#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {20446#(<= ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:18,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {20421#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20446#(<= ~counter~0 12)} is VALID [2022-04-08 08:01:18,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {20421#(<= ~counter~0 11)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:18,182 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20129#true} {20421#(<= ~counter~0 11)} #55#return; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:18,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,182 INFO L272 TraceCheckUtils]: 38: Hoare triple {20421#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {20421#(<= ~counter~0 11)} assume !!(#t~post5 < 20);havoc #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:18,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20421#(<= ~counter~0 11)} is VALID [2022-04-08 08:01:18,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#(<= ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:18,184 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20129#true} {20396#(<= ~counter~0 10)} #55#return; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:18,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,184 INFO L272 TraceCheckUtils]: 30: Hoare triple {20396#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {20396#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:18,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {20371#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20396#(<= ~counter~0 10)} is VALID [2022-04-08 08:01:18,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {20371#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:18,186 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20129#true} {20371#(<= ~counter~0 9)} #55#return; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:18,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,186 INFO L272 TraceCheckUtils]: 22: Hoare triple {20371#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {20371#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:18,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {20346#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20371#(<= ~counter~0 9)} is VALID [2022-04-08 08:01:18,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {20346#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:18,188 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20129#true} {20346#(<= ~counter~0 8)} #55#return; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:18,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,188 INFO L272 TraceCheckUtils]: 14: Hoare triple {20346#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {20346#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:18,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {20321#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20346#(<= ~counter~0 8)} is VALID [2022-04-08 08:01:18,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {20321#(<= ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20129#true} {20321#(<= ~counter~0 7)} #53#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {20129#true} assume true; {20129#true} is VALID [2022-04-08 08:01:18,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {20129#true} assume !(0 == ~cond); {20129#true} is VALID [2022-04-08 08:01:18,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {20129#true} ~cond := #in~cond; {20129#true} is VALID [2022-04-08 08:01:18,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {20321#(<= ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {20129#true} is VALID [2022-04-08 08:01:18,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {20321#(<= ~counter~0 7)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {20321#(<= ~counter~0 7)} call #t~ret6 := main(); {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20321#(<= ~counter~0 7)} {20129#true} #61#return; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {20321#(<= ~counter~0 7)} assume true; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {20129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20321#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:18,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {20129#true} call ULTIMATE.init(); {20129#true} is VALID [2022-04-08 08:01:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 26 proven. 288 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 08:01:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:18,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480118043] [2022-04-08 08:01:18,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:18,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906866530] [2022-04-08 08:01:18,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906866530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:18,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:18,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 08:01:18,193 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [322699634] [2022-04-08 08:01:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [322699634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:18,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 08:01:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294403947] [2022-04-08 08:01:18,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-08 08:01:18,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:18,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:18,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:18,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 08:01:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 08:01:18,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 08:01:18,285 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:18,749 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-04-08 08:01:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 08:01:18,749 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 119 [2022-04-08 08:01:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-08 08:01:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 134 transitions. [2022-04-08 08:01:18,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 134 transitions. [2022-04-08 08:01:18,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:18,851 INFO L225 Difference]: With dead ends: 134 [2022-04-08 08:01:18,851 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 08:01:18,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 08:01:18,852 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:18,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 162 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:01:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 08:01:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-08 08:01:19,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:19,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-08 08:01:19,017 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-08 08:01:19,017 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-08 08:01:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:19,019 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-08 08:01:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 08:01:19,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:19,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:19,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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 124 states. [2022-04-08 08:01:19,020 INFO L87 Difference]: Start difference. First operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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 124 states. [2022-04-08 08:01:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:19,021 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-04-08 08:01:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 08:01:19,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:19,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:19,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:19,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-08 08:01:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2022-04-08 08:01:19,022 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 119 [2022-04-08 08:01:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:19,023 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2022-04-08 08:01:19,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 08:01:19,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 126 transitions. [2022-04-08 08:01:19,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2022-04-08 08:01:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-08 08:01:19,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:19,224 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:19,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 08:01:19,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 08:01:19,425 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 23 times [2022-04-08 08:01:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:19,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1278701226] [2022-04-08 08:01:19,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:19,605 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:19,605 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash 636252690, now seen corresponding path program 24 times [2022-04-08 08:01:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:19,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795453459] [2022-04-08 08:01:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:19,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:19,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852500424] [2022-04-08 08:01:19,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:01:19,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:19,634 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:01:19,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 08:13:38,594 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 08:13:38,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:13:38,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 08:13:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:13:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:13:39,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {21654#true} call ULTIMATE.init(); {21654#true} is VALID [2022-04-08 08:13:39,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {21654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21654#true} is VALID [2022-04-08 08:13:39,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21654#true} {21654#true} #61#return; {21654#true} is VALID [2022-04-08 08:13:39,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {21654#true} call #t~ret6 := main(); {21654#true} is VALID [2022-04-08 08:13:39,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {21654#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {21654#true} is VALID [2022-04-08 08:13:39,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {21654#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21654#true} {21654#true} #53#return; {21654#true} is VALID [2022-04-08 08:13:39,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {21654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:13:39,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:13:39,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:13:39,507 INFO L272 TraceCheckUtils]: 14: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,508 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21654#true} {21692#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {21692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:13:39,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {21692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:13:39,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:13:39,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:13:39,509 INFO L272 TraceCheckUtils]: 22: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,516 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21654#true} {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:13:39,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {21717#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 08:13:39,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 08:13:39,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 08:13:39,517 INFO L272 TraceCheckUtils]: 30: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,518 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21654#true} {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #55#return; {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 08:13:39,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {21742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:13:39,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:13:39,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:13:39,519 INFO L272 TraceCheckUtils]: 38: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,519 INFO L290 TraceCheckUtils]: 40: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,520 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {21654#true} {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:13:39,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {21767#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:13:39,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:13:39,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:13:39,521 INFO L272 TraceCheckUtils]: 46: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,522 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21654#true} {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:13:39,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {21792#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:13:39,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:13:39,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:13:39,523 INFO L272 TraceCheckUtils]: 54: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,524 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {21654#true} {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:13:39,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {21817#(and (= (+ main_~c~0 (- 4)) 1) (= (+ (- 1) main_~y~0) 4) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:13:39,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:13:39,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:13:39,526 INFO L272 TraceCheckUtils]: 62: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,527 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {21654#true} {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} #55#return; {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:13:39,528 INFO L290 TraceCheckUtils]: 67: Hoare triple {21842#(and (= (+ main_~c~0 (- 5)) 1) (< main_~c~0 (+ main_~k~0 2)) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 08:13:39,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 08:13:39,529 INFO L290 TraceCheckUtils]: 69: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 08:13:39,529 INFO L272 TraceCheckUtils]: 70: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,529 INFO L290 TraceCheckUtils]: 73: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,529 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {21654#true} {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} #55#return; {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 08:13:39,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {21867#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 6)) 1) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,532 INFO L290 TraceCheckUtils]: 77: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,532 INFO L272 TraceCheckUtils]: 78: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,532 INFO L290 TraceCheckUtils]: 79: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,532 INFO L290 TraceCheckUtils]: 81: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,532 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21654#true} {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} #55#return; {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,533 INFO L290 TraceCheckUtils]: 83: Hoare triple {21892#(and (= (+ main_~y~0 (- 4)) 4) (= main_~c~0 8) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,533 INFO L290 TraceCheckUtils]: 84: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,534 INFO L290 TraceCheckUtils]: 85: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,534 INFO L272 TraceCheckUtils]: 86: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,534 INFO L290 TraceCheckUtils]: 87: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,534 INFO L290 TraceCheckUtils]: 88: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,534 INFO L290 TraceCheckUtils]: 89: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,534 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21654#true} {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} #55#return; {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,535 INFO L290 TraceCheckUtils]: 91: Hoare triple {21917#(and (= (+ main_~y~0 (- 5)) 4) (= main_~c~0 9) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,536 INFO L290 TraceCheckUtils]: 93: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,536 INFO L272 TraceCheckUtils]: 94: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,536 INFO L290 TraceCheckUtils]: 95: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,536 INFO L290 TraceCheckUtils]: 97: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,537 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21654#true} {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} #55#return; {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,537 INFO L290 TraceCheckUtils]: 99: Hoare triple {21942#(and (= (+ main_~y~0 (- 6)) 4) (= (+ (- 1) main_~c~0) 9) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,537 INFO L290 TraceCheckUtils]: 100: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,538 INFO L290 TraceCheckUtils]: 101: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,538 INFO L272 TraceCheckUtils]: 102: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,538 INFO L290 TraceCheckUtils]: 103: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,538 INFO L290 TraceCheckUtils]: 104: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,538 INFO L290 TraceCheckUtils]: 105: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,539 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {21654#true} {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} #55#return; {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} is VALID [2022-04-08 08:13:39,539 INFO L290 TraceCheckUtils]: 107: Hoare triple {21967#(and (= (+ main_~y~0 (- 7)) 4) (= main_~c~0 11) (< 4 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 08:13:39,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 08:13:39,540 INFO L290 TraceCheckUtils]: 109: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 08:13:39,540 INFO L272 TraceCheckUtils]: 110: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,540 INFO L290 TraceCheckUtils]: 111: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,540 INFO L290 TraceCheckUtils]: 112: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,540 INFO L290 TraceCheckUtils]: 113: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,541 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21654#true} {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} #55#return; {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 08:13:39,541 INFO L290 TraceCheckUtils]: 115: Hoare triple {21992#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} assume !(~c~0 < ~k~0); {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 08:13:39,541 INFO L272 TraceCheckUtils]: 116: Hoare triple {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {21654#true} is VALID [2022-04-08 08:13:39,541 INFO L290 TraceCheckUtils]: 117: Hoare triple {21654#true} ~cond := #in~cond; {21654#true} is VALID [2022-04-08 08:13:39,541 INFO L290 TraceCheckUtils]: 118: Hoare triple {21654#true} assume !(0 == ~cond); {21654#true} is VALID [2022-04-08 08:13:39,541 INFO L290 TraceCheckUtils]: 119: Hoare triple {21654#true} assume true; {21654#true} is VALID [2022-04-08 08:13:39,542 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {21654#true} {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} #57#return; {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 08:13:39,542 INFO L272 TraceCheckUtils]: 121: Hoare triple {22017#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:13:39,543 INFO L290 TraceCheckUtils]: 122: Hoare triple {22036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:13:39,543 INFO L290 TraceCheckUtils]: 123: Hoare triple {22040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21655#false} is VALID [2022-04-08 08:13:39,543 INFO L290 TraceCheckUtils]: 124: Hoare triple {21655#false} assume !false; {21655#false} is VALID [2022-04-08 08:13:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 28 proven. 312 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 08:13:39,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:13:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:13:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795453459] [2022-04-08 08:13:40,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:13:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852500424] [2022-04-08 08:13:40,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852500424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:13:40,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:13:40,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 08:13:40,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:13:40,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1278701226] [2022-04-08 08:13:40,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1278701226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:13:40,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:13:40,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 08:13:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116680279] [2022-04-08 08:13:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:13:40,538 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 125 [2022-04-08 08:13:40,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:13:40,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 08:13:40,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:13:40,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 08:13:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:13:40,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 08:13:40,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2022-04-08 08:13:40,609 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16)