/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:58:53,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:58:53,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:58:53,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:58:53,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:58:53,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:58:53,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:58:53,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:58:53,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:58:53,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:58:53,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:58:53,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:58:53,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:58:53,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:58:53,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:58:53,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:58:53,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:58:53,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:58:53,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:58:53,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:58:53,131 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:58:53,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:58:53,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:58:53,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:58:53,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:58:53,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:58:53,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:58:53,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:58:53,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:58:53,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:58:53,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:58:53,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:58:53,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:58:53,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:58:53,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:58:53,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:58:53,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:58:53,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:58:53,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:58:53,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:58:53,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:58:53,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:58:53,150 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:58:53,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:58:53,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:58:53,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:58:53,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:58:53,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:58:53,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:58:53,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:58:53,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:58:53,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:58:53,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:58:53,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:58:53,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:58:53,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:58:53,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:58:53,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:58:53,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:58:53,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:58:53,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:58:53,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:58:53,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:58:53,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:58:53,167 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:58:53,167 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:58:53,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:58:53,167 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:58:53,168 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:58:53,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:58:53,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:58:53,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:58:53,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:58:53,420 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:58:53,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-08 07:58:53,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dd385c0/566d5f4b099d4017b2162c9e139a9e1e/FLAGcd4b44996 [2022-04-08 07:58:53,858 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:58:53,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-08 07:58:53,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dd385c0/566d5f4b099d4017b2162c9e139a9e1e/FLAGcd4b44996 [2022-04-08 07:58:54,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dd385c0/566d5f4b099d4017b2162c9e139a9e1e [2022-04-08 07:58:54,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:58:54,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:58:54,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:58:54,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:58:54,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:58:54,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dc97ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54, skipping insertion in model container [2022-04-08 07:58:54,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:58:54,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:58:54,445 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_unwindbound10.c[458,471] [2022-04-08 07:58:54,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:58:54,470 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:58:54,481 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_unwindbound10.c[458,471] [2022-04-08 07:58:54,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:58:54,500 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:58:54,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54 WrapperNode [2022-04-08 07:58:54,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:58:54,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:58:54,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:58:54,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:58:54,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:58:54,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:58:54,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:58:54,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:58:54,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (1/1) ... [2022-04-08 07:58:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:58:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:58:54,584 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:58:54,597 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:58:54,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:58:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:58:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:58:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:58:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:58:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:58:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:58:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:58:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:58:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:58:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:58:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:58:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:58:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:58:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:58:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:58:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:58:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:58:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:58:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:58:54,697 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:58:54,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:58:54,869 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:58:54,881 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:58:54,889 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:58:54,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:58:54 BoogieIcfgContainer [2022-04-08 07:58:54,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:58:54,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:58:54,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:58:54,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:58:54,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:58:54" (1/3) ... [2022-04-08 07:58:54,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5946f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:58:54, skipping insertion in model container [2022-04-08 07:58:54,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:58:54" (2/3) ... [2022-04-08 07:58:54,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5946f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:58:54, skipping insertion in model container [2022-04-08 07:58:54,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:58:54" (3/3) ... [2022-04-08 07:58:54,903 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2022-04-08 07:58:54,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:58:54,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:58:54,954 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:58:54,960 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:58:54,961 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:58:54,977 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:58:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:58:54,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:58:54,985 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:58:54,985 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:58:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:58:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 07:58:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:58:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764690797] [2022-04-08 07:58:55,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:58:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 07:58:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:58:55,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840805601] [2022-04-08 07:58:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:58:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:58:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:58:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:58:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:58:55,208 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:58:55,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:58:55,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 07:58:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:58:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:58:55,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:58:55,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:58:55,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:58:55,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:58:55,232 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:58:55,233 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:58:55,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:58:55,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 07:58:55,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 07:58:55,233 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:58:55,234 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:58:55,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:58:55,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:58:55,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:58:55,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:58:55,239 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:58:55,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 07:58:55,240 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:58:55,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 07:58:55,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 07:58:55,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 07:58:55,241 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:58:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:58:55,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840805601] [2022-04-08 07:58:55,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840805601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:58:55,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:58:55,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:58:55,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:58:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764690797] [2022-04-08 07:58:55,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764690797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:58:55,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:58:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:58:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877676599] [2022-04-08 07:58:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:58:55,255 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:58:55,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:58:55,260 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:58:55,290 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:58:55,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:58:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:58:55,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:58:55,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:58:55,311 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 08:00:09,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24m for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 08:00:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:09,935 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 08:00:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 08:00:09,935 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 08:00:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:09,937 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 08:00:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 08:00:09,944 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 08:00:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 08:00:09,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 08:00:10,018 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 08:00:10,025 INFO L225 Difference]: With dead ends: 50 [2022-04-08 08:00:10,026 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 08:00:10,028 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 08:00:10,031 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:00:10,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 74.4s Time] [2022-04-08 08:00:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 08:00:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 08:00:10,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:10,061 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 08:00:10,061 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 08:00:10,062 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 08:00:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:10,066 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 08:00:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 08:00:10,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:10,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:10,067 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 08:00:10,068 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 08:00:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:10,071 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 08:00:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 08:00:10,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:10,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:10,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:10,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:10,073 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 08:00:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 08:00:10,076 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 08:00:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:10,077 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 08:00:10,077 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 08:00:10,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 08:00:10,106 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 08:00:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 08:00:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:00:10,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:10,108 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 08:00:10,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:00:10,108 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 08:00:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:10,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620435171] [2022-04-08 08:00:10,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:00:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 08:00:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:10,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396337098] [2022-04-08 08:00:10,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:10,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:10,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769884898] [2022-04-08 08:00:10,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:00:10,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:10,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:10,135 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 08:00:10,157 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 08:00:10,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 08:00:10,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:10,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 08:00:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:10,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:10,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 08:00:10,462 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 08:00:10,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:10,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:10,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:10,464 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 08:00:10,465 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 08:00:10,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:10,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:10,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:10,468 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 08:00:10,469 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 08:00:10,470 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 08:00:10,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {243#false} is VALID [2022-04-08 08:00:10,471 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 08:00:10,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 08:00:10,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 08:00:10,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 08:00:10,473 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 08:00:10,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:00:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:10,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396337098] [2022-04-08 08:00:10,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:10,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769884898] [2022-04-08 08:00:10,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769884898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:10,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:10,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:00:10,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:10,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620435171] [2022-04-08 08:00:10,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620435171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:10,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:10,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:00:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698048819] [2022-04-08 08:00:10,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:10,478 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 08:00:10,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:10,479 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 08:00:10,499 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 08:00:10,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:00:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:00:10,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:00:10,504 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 08:00:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:10,599 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 08:00:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:00:10,599 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 08:00:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:10,600 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 08:00:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 08:00:10,602 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 08:00:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 08:00:10,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 08:00:10,638 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 08:00:10,640 INFO L225 Difference]: With dead ends: 34 [2022-04-08 08:00:10,640 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 08:00:10,641 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 08:00:10,642 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 08:00:10,642 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 08:00:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 08:00:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 08:00:10,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:10,656 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 08:00:10,656 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 08:00:10,656 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 08:00:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:10,659 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 08:00:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 08:00:10,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:10,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:10,660 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 08:00:10,660 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 08:00:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:10,663 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 08:00:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 08:00:10,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:10,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:10,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:10,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:10,664 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 08:00:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 08:00:10,666 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 08:00:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:10,667 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 08:00:10,667 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 08:00:10,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 08:00:10,697 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 08:00:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 08:00:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:00:10,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:10,699 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 08:00:10,733 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 08:00:10,915 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 08:00:10,916 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 08:00:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:10,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786378258] [2022-04-08 08:00:10,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:00:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 08:00:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:10,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213712774] [2022-04-08 08:00:10,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:10,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:10,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435667626] [2022-04-08 08:00:10,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:00:10,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:10,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:10,945 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 08:00:10,947 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 08:00:10,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 08:00:10,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:10,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:00:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:11,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:11,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 08:00:11,108 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 08:00:11,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 08:00:11,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 08:00:11,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 08:00:11,109 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 08:00:11,109 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 08:00:11,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 08:00:11,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 08:00:11,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 08:00:11,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 08:00:11,110 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 08:00:11,111 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 08:00:11,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:00:11,113 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 08:00:11,113 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 08:00:11,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 08:00:11,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 08:00:11,116 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 08:00:11,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:00:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:11,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213712774] [2022-04-08 08:00:11,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435667626] [2022-04-08 08:00:11,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435667626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:11,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:11,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:00:11,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:11,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786378258] [2022-04-08 08:00:11,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786378258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:11,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:11,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:00:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805096910] [2022-04-08 08:00:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:11,118 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 08:00:11,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:11,119 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 08:00:11,133 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 08:00:11,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:00:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:11,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:00:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:00:11,135 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 08:00:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:11,313 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 08:00:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:00:11,314 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 08:00:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:11,314 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 08:00:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 08:00:11,317 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 08:00:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 08:00:11,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 08:00:11,357 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 08:00:11,358 INFO L225 Difference]: With dead ends: 36 [2022-04-08 08:00:11,359 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 08:00:11,359 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 08:00:11,360 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 08:00:11,360 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 08:00:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 08:00:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 08:00:11,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:11,379 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 08:00:11,380 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 08:00:11,380 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 08:00:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:11,382 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 08:00:11,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 08:00:11,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:11,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:11,383 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 08:00:11,383 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 08:00:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:11,386 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 08:00:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 08:00:11,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:11,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:11,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:11,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:11,387 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 08:00:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 08:00:11,389 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 08:00:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:11,389 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 08:00:11,389 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 08:00:11,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 08:00:11,424 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 08:00:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 08:00:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:00:11,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:11,425 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 08:00:11,452 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 08:00:11,640 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 08:00:11,641 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 08:00:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:11,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157225477] [2022-04-08 08:00:11,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:11,850 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:11,853 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 08:00:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549280376] [2022-04-08 08:00:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:11,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336640018] [2022-04-08 08:00:11,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:00:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:11,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:11,904 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 08:00:11,931 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 08:00:12,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:00:12,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:12,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:00:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:12,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:12,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 08:00:12,289 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 08:00:12,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:12,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:12,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:12,291 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 08:00:12,291 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 08:00:12,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:12,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:12,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:12,293 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 08:00:12,293 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 08:00:12,294 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 08:00:12,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:12,295 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 08:00:12,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:12,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:12,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:12,297 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 08:00:12,297 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 08:00:12,298 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 08:00:12,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-08 08:00:12,299 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 08:00:12,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 08:00:12,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 08:00:12,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 08:00:12,300 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 08:00:12,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:00:12,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 08:00:12,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 08:00:12,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 08:00:12,478 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 08:00:12,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-08 08:00:12,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:00:12,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~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; {830#(< ~counter~0 10)} is VALID [2022-04-08 08:00:12,480 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 10)} #55#return; {830#(< ~counter~0 10)} is VALID [2022-04-08 08:00:12,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 08:00:12,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 08:00:12,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 08:00:12,481 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~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)); {731#true} is VALID [2022-04-08 08:00:12,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-08 08:00:12,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-08 08:00:12,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-08 08:00:12,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 9)} #53#return; {855#(< ~counter~0 9)} is VALID [2022-04-08 08:00:12,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 08:00:12,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 08:00:12,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 08:00:12,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 08:00:12,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~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; {855#(< ~counter~0 9)} is VALID [2022-04-08 08:00:12,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 9)} call #t~ret6 := main(); {855#(< ~counter~0 9)} is VALID [2022-04-08 08:00:12,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 9)} {731#true} #61#return; {855#(< ~counter~0 9)} is VALID [2022-04-08 08:00:12,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 9)} assume true; {855#(< ~counter~0 9)} is VALID [2022-04-08 08:00:12,488 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 9)} is VALID [2022-04-08 08:00:12,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 08:00:12,488 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 08:00:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549280376] [2022-04-08 08:00:12,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:12,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336640018] [2022-04-08 08:00:12,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336640018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:00:12,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:00:12,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 08:00:12,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157225477] [2022-04-08 08:00:12,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157225477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:12,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:00:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445647506] [2022-04-08 08:00:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:12,491 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 08:00:12,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:12,491 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 08:00:12,510 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 08:00:12,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:00:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:00:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:00:12,512 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 08:00:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:12,629 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 08:00:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:00:12,630 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 08:00:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:12,630 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 08:00:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 08:00:12,632 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 08:00:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 08:00:12,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 08:00:12,688 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 08:00:12,693 INFO L225 Difference]: With dead ends: 42 [2022-04-08 08:00:12,694 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 08:00:12,694 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 08:00:12,698 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 08:00:12,699 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 08:00:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 08:00:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 08:00:12,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:12,719 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 08:00:12,719 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 08:00:12,720 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 08:00:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:12,721 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 08:00:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 08:00:12,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:12,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:12,722 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 08:00:12,723 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 08:00:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:12,724 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 08:00:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 08:00:12,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:12,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:12,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:12,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:12,726 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 08:00:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 08:00:12,727 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 08:00:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:12,727 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 08:00:12,727 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 08:00:12,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 08:00:12,764 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 08:00:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 08:00:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:00:12,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:12,765 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 08:00:12,779 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 08:00:12,977 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 08:00:12,978 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:12,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 08:00:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:12,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888658062] [2022-04-08 08:00:13,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:13,149 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:13,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 08:00:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:13,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432071810] [2022-04-08 08:00:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:13,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:13,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841216168] [2022-04-08 08:00:13,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:00:13,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:13,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:13,178 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 08:00:13,183 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 08:00:13,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:00:13,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:13,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 08:00:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:13,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:13,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 08:00:13,362 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 08:00:13,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 08:00:13,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 08:00:13,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 08:00:13,365 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 08:00:13,365 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 08:00:13,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 08:00:13,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 08:00:13,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 08:00:13,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 08:00:13,375 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 08:00:13,375 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 08:00:13,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:00:13,376 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 08:00:13,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 08:00:13,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 08:00:13,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 08:00:13,377 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 08:00:13,378 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 08:00:13,378 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 08:00:13,379 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 < 10);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 08:00:13,380 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 08:00:13,380 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 08:00:13,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 08:00:13,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 08:00:13,381 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 08:00:13,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:00:13,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 08:00:13,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 08:00:13,539 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 08:00:13,540 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 08:00:13,541 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 < 10);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 08:00:13,541 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 08:00:17,900 WARN 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 UNKNOWN [2022-04-08 08:00:17,902 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 08:00:17,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 08:00:17,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 08:00:17,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 08:00:17,903 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 08:00:17,903 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 < 10);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 08:00:17,905 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 08:00:17,906 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 08:00:17,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 08:00:17,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 08:00:17,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 08:00:17,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 08:00:17,907 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 08:00:17,907 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 08:00:17,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 08:00:17,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 08:00:17,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 08:00:17,907 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 08:00:17,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 08:00:17,908 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 08:00:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:17,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432071810] [2022-04-08 08:00:17,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:17,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841216168] [2022-04-08 08:00:17,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841216168] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 08:00:17,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:00:17,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 08:00:17,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:17,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888658062] [2022-04-08 08:00:17,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888658062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:17,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:17,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:00:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183716757] [2022-04-08 08:00:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:17,910 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 08:00:17,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:17,910 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 08:00:22,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:22,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:00:22,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:22,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:00:22,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:00:22,228 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 08:00:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:22,381 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 08:00:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:00:22,381 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 08:00:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:22,381 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 08:00:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 08:00:22,383 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 08:00:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 08:00:22,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 08:00:26,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:26,725 INFO L225 Difference]: With dead ends: 40 [2022-04-08 08:00:26,725 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 08:00:26,725 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 08:00:26,726 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 08:00:26,726 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 08:00:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 08:00:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 08:00:26,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:26,754 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 08:00:26,754 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 08:00:26,755 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 08:00:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:26,756 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 08:00:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 08:00:26,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:26,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:26,757 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 08:00:26,757 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 08:00:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:26,759 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 08:00:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 08:00:26,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:26,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:26,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:26,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:26,760 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 08:00:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 08:00:26,761 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 08:00:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:26,762 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 08:00:26,762 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 08:00:26,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 08:00:31,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 08:00:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 08:00:31,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:31,097 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 08:00:31,121 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 08:00:31,297 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 08:00:31,298 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 08:00:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843967225] [2022-04-08 08:00:31,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:31,427 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:31,427 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 08:00:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:31,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363260984] [2022-04-08 08:00:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:31,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:31,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982887595] [2022-04-08 08:00:31,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:00:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:31,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:31,440 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 08:00:31,476 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 08:00:31,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:00:31,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:31,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 08:00:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:31,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:31,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 08:00:31,861 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 08:00:31,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 08:00:31,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 08:00:31,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 08:00:31,862 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 08:00:31,862 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 08:00:31,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 08:00:31,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 08:00:31,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 08:00:31,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 08:00:31,864 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 08:00:31,865 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 08:00:31,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:00:31,866 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 08:00:31,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 08:00:31,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 08:00:31,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 08:00:31,868 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 08:00:31,868 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 08:00:31,869 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 08:00:31,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 08:00:31,873 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 08:00:31,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 08:00:31,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 08:00:31,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 08:00:31,874 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 08:00:31,875 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 08:00:31,875 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 08:00:31,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 08:00:31,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 08:00:31,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 08:00:31,876 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 08:00:31,877 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 08:00:31,878 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 08:00:31,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 08:00:31,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 08:00:31,883 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 08:00:31,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:00:32,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:32,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363260984] [2022-04-08 08:00:32,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:32,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982887595] [2022-04-08 08:00:32,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982887595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:00:32,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:00:32,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 08:00:32,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:32,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843967225] [2022-04-08 08:00:32,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843967225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:32,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:32,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:00:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349393732] [2022-04-08 08:00:32,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:32,278 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 08:00:32,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:32,279 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 08:00:32,308 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 08:00:32,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:00:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:00:32,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:00:32,310 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 08:00:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:32,572 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 08:00:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 08:00:32,572 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 08:00:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:32,573 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 08:00:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 08:00:32,574 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 08:00:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 08:00:32,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 08:00:32,613 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 08:00:32,614 INFO L225 Difference]: With dead ends: 44 [2022-04-08 08:00:32,614 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 08:00:32,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:00:32,615 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:00:32,615 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.1s Time] [2022-04-08 08:00:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 08:00:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 08:00:32,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:32,653 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 08:00:32,653 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 08:00:32,653 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 08:00:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:32,656 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 08:00:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 08:00:32,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:32,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:32,657 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 08:00:32,668 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 08:00:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:32,670 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 08:00:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 08:00:32,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:32,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:32,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:32,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:32,671 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 08:00:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 08:00:32,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 08:00:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:32,673 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 08:00:32,673 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 08:00:32,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 08:00:37,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 08:00:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 08:00:37,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:37,042 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 08:00:37,071 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 08:00:37,243 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 08:00:37,243 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 08:00:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:37,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91767747] [2022-04-08 08:00:37,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:37,372 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:37,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 08:00:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:37,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696984599] [2022-04-08 08:00:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:37,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:37,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683148599] [2022-04-08 08:00:37,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:00:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:37,385 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 08:00:37,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 08:00:37,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:00:37,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:37,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 08:00:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:37,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:37,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 08:00:37,657 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 08:00:37,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:37,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:37,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:37,658 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 08:00:37,659 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 08:00:37,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:37,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:37,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:37,660 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 08:00:37,661 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 08:00:37,661 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 08:00:37,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:37,662 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 08:00:37,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:37,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:37,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:37,664 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 08:00:37,664 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 08:00:37,664 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 08:00:37,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:37,665 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 08:00:37,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:37,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:37,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:37,667 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 08:00:37,667 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 08:00:37,668 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 08:00:37,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-08 08:00:37,668 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 08:00:37,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 08:00:37,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 08:00:37,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 08:00:37,669 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 08:00:37,669 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 08:00:37,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 08:00:37,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 08:00:37,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 08:00:37,671 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 08:00:37,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:00:37,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 08:00:37,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 08:00:37,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 08:00:37,894 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 08:00:37,894 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 08:00:37,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 08:00:37,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 08:00:37,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 08:00:37,894 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 08:00:37,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-08 08:00:37,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:00:37,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~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; {2079#(< ~counter~0 10)} is VALID [2022-04-08 08:00:37,898 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 10)} #55#return; {2079#(< ~counter~0 10)} is VALID [2022-04-08 08:00:37,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 08:00:37,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 08:00:37,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 08:00:37,898 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~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)); {1925#true} is VALID [2022-04-08 08:00:37,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-08 08:00:37,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-08 08:00:37,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~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; {2104#(< ~counter~0 9)} is VALID [2022-04-08 08:00:37,903 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 9)} #55#return; {2104#(< ~counter~0 9)} is VALID [2022-04-08 08:00:37,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 08:00:37,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 08:00:37,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 08:00:37,903 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~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)); {1925#true} is VALID [2022-04-08 08:00:37,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-08 08:00:37,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-08 08:00:37,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-08 08:00:37,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 8)} #53#return; {2129#(< ~counter~0 8)} is VALID [2022-04-08 08:00:37,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 08:00:37,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 08:00:37,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 08:00:37,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 08:00:37,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~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; {2129#(< ~counter~0 8)} is VALID [2022-04-08 08:00:37,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 8)} call #t~ret6 := main(); {2129#(< ~counter~0 8)} is VALID [2022-04-08 08:00:37,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 8)} {1925#true} #61#return; {2129#(< ~counter~0 8)} is VALID [2022-04-08 08:00:37,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 8)} assume true; {2129#(< ~counter~0 8)} is VALID [2022-04-08 08:00:37,907 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 8)} is VALID [2022-04-08 08:00:37,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 08:00:37,908 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 08:00:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:37,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696984599] [2022-04-08 08:00:37,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:37,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683148599] [2022-04-08 08:00:37,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683148599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:00:37,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:00:37,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 08:00:37,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:37,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91767747] [2022-04-08 08:00:37,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91767747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:37,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:37,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:00:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618918777] [2022-04-08 08:00:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:37,910 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 08:00:37,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:37,910 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 08:00:37,942 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 08:00:37,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:00:37,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:37,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:00:37,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:00:37,944 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 08:00:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:38,099 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 08:00:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:00:38,100 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 08:00:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:38,100 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 08:00:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 08:00:38,102 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 08:00:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 08:00:38,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 08:00:38,148 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 08:00:38,149 INFO L225 Difference]: With dead ends: 54 [2022-04-08 08:00:38,149 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 08:00:38,150 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 08:00:38,150 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 08:00:38,150 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 08:00:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 08:00:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 08:00:38,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:38,193 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 08:00:38,193 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 08:00:38,193 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 08:00:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:38,195 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 08:00:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 08:00:38,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:38,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:38,196 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 08:00:38,196 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 08:00:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:38,197 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 08:00:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 08:00:38,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:38,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:38,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:38,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:38,198 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 08:00:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 08:00:38,200 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 08:00:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:38,200 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 08:00:38,200 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 08:00:38,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 08:00:42,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 08:00:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 08:00:42,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:42,500 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 08:00:42,521 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 08:00:42,700 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 08:00:42,701 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 08:00:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:42,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726915871] [2022-04-08 08:00:42,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:42,856 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:42,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 08:00:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:42,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444587782] [2022-04-08 08:00:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:42,878 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:42,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674290221] [2022-04-08 08:00:42,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:00:42,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:42,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:42,879 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 08:00:42,880 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 08:00:42,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:00:42,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:42,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 08:00:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:42,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:43,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 08:00:43,308 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 08:00:43,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 08:00:43,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 08:00:43,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 08:00:43,309 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 08:00:43,309 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 08:00:43,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 08:00:43,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 08:00:43,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 08:00:43,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 08:00:43,310 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 08:00:43,310 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 08:00:43,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:00:43,311 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 08:00:43,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 08:00:43,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 08:00:43,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 08:00:43,312 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 08:00:43,313 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 08:00:43,313 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 08:00:43,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 08:00:43,314 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 08:00:43,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 08:00:43,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 08:00:43,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 08:00:43,315 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 08:00:43,315 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 08:00:43,316 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 08:00:43,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 08:00:43,318 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 08:00:43,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 08:00:43,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 08:00:43,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 08:00:43,318 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 08:00:43,319 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 08:00:43,319 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 08:00:43,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 08:00:43,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 08:00:43,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 08:00:43,320 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 08:00:43,321 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 08:00:43,321 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 08:00:43,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 08:00:43,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 08:00:43,322 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 08:00:43,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:00:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:43,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444587782] [2022-04-08 08:00:43,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:43,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674290221] [2022-04-08 08:00:43,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674290221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:00:43,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:00:43,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 08:00:43,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:43,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726915871] [2022-04-08 08:00:43,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726915871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:43,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:43,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:00:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035249256] [2022-04-08 08:00:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:43,610 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 08:00:43,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:43,612 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 08:00:43,647 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 08:00:43,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:00:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:00:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 08:00:43,649 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 08:00:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:44,022 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 08:00:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:00:44,023 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 08:00:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:44,023 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 08:00:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 08:00:44,025 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 08:00:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 08:00:44,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 08:00:44,071 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 08:00:44,072 INFO L225 Difference]: With dead ends: 52 [2022-04-08 08:00:44,072 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 08:00:44,072 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 08:00:44,073 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 08:00:44,073 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 08:00:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 08:00:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 08:00:44,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:44,127 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 08:00:44,128 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 08:00:44,129 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 08:00:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:44,149 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 08:00:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 08:00:44,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:44,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:44,154 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 08:00:44,154 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 08:00:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:44,156 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 08:00:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 08:00:44,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:44,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:44,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:44,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:44,163 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 08:00:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 08:00:44,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 08:00:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:44,165 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 08:00:44,165 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 08:00:44,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 08:00:48,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 08:00:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 08:00:48,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:48,671 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 08:00:48,690 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 08:00:48,875 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 08:00:48,876 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 08:00:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:48,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [685798733] [2022-04-08 08:00:49,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:49,009 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:49,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 08:00:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:49,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431095019] [2022-04-08 08:00:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:49,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339082559] [2022-04-08 08:00:49,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:00:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:49,023 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 08:00:49,024 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 08:00:49,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:00:49,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:00:49,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 08:00:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:00:49,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:00:49,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 08:00:49,346 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 08:00:49,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:49,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:49,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:49,348 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 08:00:49,349 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 08:00:49,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:49,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:49,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 08:00:49,350 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 08:00:49,351 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 08:00:49,351 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 08:00:49,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:49,352 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 08:00:49,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:49,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:49,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 08:00:49,354 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 08:00:49,354 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 08:00:49,355 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 08:00:49,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:49,356 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 08:00:49,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:49,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:49,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 08:00:49,357 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 08:00:49,358 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 08:00:49,359 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 08:00:49,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 08:00:49,360 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 08:00:49,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 08:00:49,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 08:00:49,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 08:00:49,361 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 08:00:49,362 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 08:00:49,362 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 08:00:49,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-08 08:00:49,363 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 08:00:49,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 08:00:49,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 08:00:49,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 08:00:49,363 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 08:00:49,363 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 08:00:49,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 08:00:49,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 08:00:49,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 08:00:49,364 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 08:00:49,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:00:49,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 08:00:49,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 08:00:49,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 08:00:49,624 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 08:00:49,625 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 08:00:49,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 08:00:49,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 08:00:49,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 08:00:49,634 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 08:00:49,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-08 08:00:49,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:00:49,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~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; {3129#(< ~counter~0 10)} is VALID [2022-04-08 08:00:49,637 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 10)} #55#return; {3129#(< ~counter~0 10)} is VALID [2022-04-08 08:00:49,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 08:00:49,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 08:00:49,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 08:00:49,638 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~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)); {2950#true} is VALID [2022-04-08 08:00:49,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-08 08:00:49,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-08 08:00:49,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~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; {3154#(< ~counter~0 9)} is VALID [2022-04-08 08:00:49,640 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 9)} #55#return; {3154#(< ~counter~0 9)} is VALID [2022-04-08 08:00:49,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 08:00:49,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 08:00:49,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 08:00:49,640 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~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)); {2950#true} is VALID [2022-04-08 08:00:49,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-08 08:00:49,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-08 08:00:49,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~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; {3179#(< ~counter~0 8)} is VALID [2022-04-08 08:00:49,642 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 8)} #55#return; {3179#(< ~counter~0 8)} is VALID [2022-04-08 08:00:49,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 08:00:49,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 08:00:49,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 08:00:49,642 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~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)); {2950#true} is VALID [2022-04-08 08:00:49,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-08 08:00:49,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-08 08:00:49,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-08 08:00:49,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 7)} #53#return; {3204#(< ~counter~0 7)} is VALID [2022-04-08 08:00:49,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 08:00:49,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 08:00:49,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 08:00:49,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 08:00:49,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~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; {3204#(< ~counter~0 7)} is VALID [2022-04-08 08:00:49,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 7)} call #t~ret6 := main(); {3204#(< ~counter~0 7)} is VALID [2022-04-08 08:00:49,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 7)} {2950#true} #61#return; {3204#(< ~counter~0 7)} is VALID [2022-04-08 08:00:49,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 7)} assume true; {3204#(< ~counter~0 7)} is VALID [2022-04-08 08:00:49,646 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 7)} is VALID [2022-04-08 08:00:49,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 08:00:49,646 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 08:00:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:00:49,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431095019] [2022-04-08 08:00:49,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:00:49,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339082559] [2022-04-08 08:00:49,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339082559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:00:49,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:00:49,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 08:00:49,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:00:49,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [685798733] [2022-04-08 08:00:49,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [685798733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:00:49,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:00:49,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 08:00:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981766559] [2022-04-08 08:00:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:00:49,652 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 08:00:49,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:00:49,653 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 08:00:49,687 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 08:00:49,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 08:00:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:49,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 08:00:49,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:00:49,688 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 08:00:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:49,884 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 08:00:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:00:49,884 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 08:00:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:00:49,885 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 08:00:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 08:00:49,887 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 08:00:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 08:00:49,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 08:00:49,944 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 08:00:49,947 INFO L225 Difference]: With dead ends: 62 [2022-04-08 08:00:49,947 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 08:00:49,947 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 08:00:49,949 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 08:00:49,950 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 08:00:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 08:00:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 08:00:50,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:00:50,013 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 08:00:50,014 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 08:00:50,016 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 08:00:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:50,019 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 08:00:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 08:00:50,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:50,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:50,020 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 08:00:50,020 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 08:00:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:00:50,021 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 08:00:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 08:00:50,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:00:50,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:00:50,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:00:50,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:00:50,023 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 08:00:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 08:00:50,025 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 08:00:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:00:50,025 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 08:00:50,025 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 08:00:50,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 08:00:54,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:00:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 08:00:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 08:00:54,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:00:54,410 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 08:00:54,429 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 08:00:54,619 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 08:00:54,619 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:00:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:00:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 08:00:54,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:00:54,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161167272] [2022-04-08 08:00:54,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:00:54,756 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:00:54,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:00:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 08:00:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:00:54,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954736311] [2022-04-08 08:00:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:00:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:00:54,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:00:54,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57361527] [2022-04-08 08:00:54,769 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:00:54,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:00:54,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:00:54,772 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 08:00:54,782 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 08:01:01,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 08:01:01,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:01,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 08:01:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:01,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:01,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 08:01:01,867 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 08:01:01,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 08:01:01,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 08:01:01,868 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 08:01:01,868 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 08:01:01,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 08:01:01,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 08:01:01,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,868 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 08:01:01,868 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 08:01:01,869 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 08:01:01,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:01,869 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 08:01:01,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 08:01:01,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 08:01:01,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,870 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 08:01:01,871 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 08:01:01,871 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 08:01:01,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:01:01,872 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 08:01:01,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 08:01:01,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 08:01:01,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,872 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 08:01:01,873 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 08:01:01,874 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 08:01:01,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:01,874 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 08:01:01,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 08:01:01,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 08:01:01,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,879 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 08:01:01,880 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 08:01:01,880 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 08:01:01,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 08:01:01,881 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 08:01:01,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 08:01:01,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 08:01:01,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,882 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 08:01:01,882 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 08:01:01,882 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 08:01:01,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 08:01:01,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 08:01:01,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 08:01:01,883 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 08:01:01,884 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 08:01:01,885 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 08:01:01,885 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 08:01:01,885 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 08:01:01,886 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 08:01:01,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:02,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954736311] [2022-04-08 08:01:02,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:02,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57361527] [2022-04-08 08:01:02,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57361527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:02,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:02,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 08:01:02,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:02,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161167272] [2022-04-08 08:01:02,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161167272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:02,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:02,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:01:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039411676] [2022-04-08 08:01:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:02,324 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 08:01:02,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:02,326 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 08:01:02,358 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 08:01:02,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:01:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:01:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 08:01:02,359 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 08:01:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:02,770 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 08:01:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 08:01:02,770 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 08:01:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:02,771 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 08:01:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 08:01:02,772 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 08:01:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 08:01:02,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 08:01:02,830 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 08:01:02,831 INFO L225 Difference]: With dead ends: 60 [2022-04-08 08:01:02,831 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 08:01:02,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:01:02,832 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 08:01:02,833 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 08:01:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 08:01:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 08:01:02,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:02,909 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 08:01:02,910 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 08:01:02,910 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 08:01:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:02,913 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 08:01:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 08:01:02,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:02,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:02,913 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 08:01:02,914 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 08:01:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:02,921 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 08:01:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 08:01:02,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:02,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:02,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:02,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:02,922 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 08:01:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 08:01:02,925 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 08:01:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:02,926 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 08:01:02,927 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 08:01:02,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 08:01:07,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 08:01:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 08:01:07,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:07,205 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 08:01:07,217 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 08:01:07,412 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 08:01:07,412 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:07,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 08:01:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:07,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [665981813] [2022-04-08 08:01:07,518 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,518 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:07,518 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 08:01:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:07,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438427736] [2022-04-08 08:01:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:07,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:07,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090137859] [2022-04-08 08:01:07,530 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:01:07,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:07,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:07,531 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 08:01:07,540 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 08:01:07,929 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 08:01:07,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:07,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 08:01:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:07,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:08,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 08:01:08,184 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 08:01:08,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:08,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:08,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:08,185 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 08:01:08,186 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 08:01:08,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:08,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:08,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:08,187 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 08:01:08,187 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 08:01:08,188 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 08:01:08,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:08,189 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 08:01:08,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:08,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:08,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:08,190 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 08:01:08,190 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 08:01:08,190 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 08:01:08,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:08,191 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 08:01:08,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:08,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:08,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:08,193 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 08:01:08,193 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 08:01:08,193 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 08:01:08,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:08,194 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 08:01:08,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:08,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:08,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:08,195 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 08:01:08,196 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 08:01:08,196 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 08:01:08,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:08,197 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 08:01:08,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:08,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:08,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:08,199 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 08:01:08,199 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 08:01:08,200 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 08:01:08,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-08 08:01:08,200 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 08:01:08,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 08:01:08,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-08 08:01:08,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-08 08:01:08,201 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 08:01:08,201 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 08:01:08,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 08:01:08,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 08:01:08,201 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 08:01:08,201 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 08:01:08,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:08,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 08:01:08,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 08:01:08,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 08:01:08,521 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 08:01:08,521 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 08:01:08,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 08:01:08,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 08:01:08,521 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 08:01:08,521 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 08:01:08,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-08 08:01:08,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:01:08,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~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; {4352#(< ~counter~0 10)} is VALID [2022-04-08 08:01:08,523 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 10)} #55#return; {4352#(< ~counter~0 10)} is VALID [2022-04-08 08:01:08,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 08:01:08,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 08:01:08,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 08:01:08,523 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~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)); {4148#true} is VALID [2022-04-08 08:01:08,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-08 08:01:08,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-08 08:01:08,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~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; {4377#(< ~counter~0 9)} is VALID [2022-04-08 08:01:08,525 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 9)} #55#return; {4377#(< ~counter~0 9)} is VALID [2022-04-08 08:01:08,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 08:01:08,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 08:01:08,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 08:01:08,525 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~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)); {4148#true} is VALID [2022-04-08 08:01:08,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-08 08:01:08,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-08 08:01:08,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~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; {4402#(< ~counter~0 8)} is VALID [2022-04-08 08:01:08,527 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 8)} #55#return; {4402#(< ~counter~0 8)} is VALID [2022-04-08 08:01:08,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 08:01:08,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 08:01:08,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 08:01:08,528 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~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)); {4148#true} is VALID [2022-04-08 08:01:08,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-08 08:01:08,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-08 08:01:08,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~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; {4427#(< ~counter~0 7)} is VALID [2022-04-08 08:01:08,529 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 7)} #55#return; {4427#(< ~counter~0 7)} is VALID [2022-04-08 08:01:08,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 08:01:08,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 08:01:08,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 08:01:08,529 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~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)); {4148#true} is VALID [2022-04-08 08:01:08,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-08 08:01:08,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-08 08:01:08,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 6)} is VALID [2022-04-08 08:01:08,533 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 6)} #53#return; {4452#(< ~counter~0 6)} is VALID [2022-04-08 08:01:08,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 08:01:08,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 08:01:08,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 08:01:08,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-08 08:01:08,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 6)} 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 6)} is VALID [2022-04-08 08:01:08,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 6)} call #t~ret6 := main(); {4452#(< ~counter~0 6)} is VALID [2022-04-08 08:01:08,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 6)} {4148#true} #61#return; {4452#(< ~counter~0 6)} is VALID [2022-04-08 08:01:08,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 6)} assume true; {4452#(< ~counter~0 6)} is VALID [2022-04-08 08:01:08,535 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 6)} is VALID [2022-04-08 08:01:08,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 08:01:08,536 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 08:01:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438427736] [2022-04-08 08:01:08,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090137859] [2022-04-08 08:01:08,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090137859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:08,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:08,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 08:01:08,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:08,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [665981813] [2022-04-08 08:01:08,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [665981813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:08,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:08,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 08:01:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82294245] [2022-04-08 08:01:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:08,537 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 08:01:08,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:08,538 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 08:01:08,584 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 08:01:08,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 08:01:08,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 08:01:08,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:01:08,585 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 08:01:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:08,779 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-08 08:01:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 08:01:08,779 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 08:01:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:08,779 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 08:01:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 08:01:08,782 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 08:01:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 08:01:08,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-08 08:01:08,834 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 08:01:08,836 INFO L225 Difference]: With dead ends: 70 [2022-04-08 08:01:08,836 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 08:01:08,836 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 08:01:08,837 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 08:01:08,837 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 08:01:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 08:01:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 08:01:08,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:08,898 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 08:01:08,898 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 08:01:08,898 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 08:01:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:08,903 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 08:01:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 08:01:08,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:08,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:08,903 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 08:01:08,903 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 08:01:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:08,911 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 08:01:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 08:01:08,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:08,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:08,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:08,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:08,912 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 08:01:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 08:01:08,915 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-08 08:01:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:08,915 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 08:01:08,915 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 08:01:08,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 08:01:13,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 08:01:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 08:01:13,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:13,189 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 08:01:13,198 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 08:01:13,389 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 08:01:13,390 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-08 08:01:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:13,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [341420486] [2022-04-08 08:01:13,498 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,498 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:13,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-08 08:01:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:13,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064545099] [2022-04-08 08:01:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:13,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:13,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [237332165] [2022-04-08 08:01:13,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:13,536 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 08:01:13,560 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 08:01:14,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:14,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:14,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 08:01:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:14,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:14,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 08:01:14,521 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 08:01:14,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 08:01:14,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 08:01:14,522 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 08:01:14,522 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 08:01:14,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 08:01:14,522 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 08:01:14,523 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 08:01:14,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:14,523 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 08:01:14,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,524 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 08:01:14,524 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 08:01:14,524 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 08:01:14,525 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 < 10);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 08:01:14,525 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 08:01:14,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,531 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 08:01:14,532 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 08:01:14,533 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 08:01:14,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 08:01:14,533 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 08:01:14,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,534 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 08:01:14,535 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 08:01:14,535 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 08:01:14,536 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 < 10);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 08:01:14,536 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 08:01:14,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,537 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 08:01:14,537 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 08:01:14,538 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 08:01:14,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 08:01:14,538 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 08:01:14,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,539 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 08:01:14,540 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 08:01:14,540 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 08:01:14,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 08:01:14,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 08:01:14,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 08:01:14,541 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 08:01:14,541 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 08:01:14,542 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 08:01:14,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 08:01:14,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 08:01:14,543 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 08:01:14,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064545099] [2022-04-08 08:01:15,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237332165] [2022-04-08 08:01:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237332165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:15,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:15,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 08:01:15,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [341420486] [2022-04-08 08:01:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [341420486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:15,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:15,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:01:15,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287259671] [2022-04-08 08:01:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:15,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 08:01:15,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:15,107 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 08:01:15,141 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 08:01:15,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:01:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:01:15,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:01:15,142 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 08:01:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:15,709 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-08 08:01:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 08:01:15,710 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 08:01:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:15,710 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 08:01:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 08:01:15,711 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 08:01:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 08:01:15,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-08 08:01:15,760 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 08:01:15,761 INFO L225 Difference]: With dead ends: 68 [2022-04-08 08:01:15,761 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 08:01:15,762 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 08:01:15,762 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 08:01:15,762 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 08:01:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 08:01:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 08:01:15,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:15,836 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 08:01:15,837 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 08:01:15,837 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 08:01:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:15,838 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 08:01:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 08:01:15,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:15,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:15,839 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 08:01:15,839 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 08:01:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:15,840 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 08:01:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 08:01:15,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:15,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:15,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:15,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:15,841 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 08:01:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-08 08:01:15,842 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-08 08:01:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:15,842 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-08 08:01:15,843 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 08:01:15,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-08 08:01:20,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 08:01:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 08:01:20,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:20,123 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 08:01:20,128 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 08:01:20,323 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 08:01:20,324 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-08 08:01:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:20,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985354461] [2022-04-08 08:01:20,426 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:20,426 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:20,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-08 08:01:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:20,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207140981] [2022-04-08 08:01:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:20,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:20,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603505304] [2022-04-08 08:01:20,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:20,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:20,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:20,440 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 08:01:20,449 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 08:01:20,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:20,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:20,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 08:01:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:20,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:20,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 08:01:20,780 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 08:01:20,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:20,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:20,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:20,783 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 08:01:20,783 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 08:01:20,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:20,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:20,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:20,784 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 08:01:20,785 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 08:01:20,786 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 08:01:20,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:20,787 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 08:01:20,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:20,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:20,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:20,788 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 08:01:20,788 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 08:01:20,789 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 08:01:20,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:20,789 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 08:01:20,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:20,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:20,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:20,791 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 08:01:20,791 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 08:01:20,792 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 08:01:20,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:20,794 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 08:01:20,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:20,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:20,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:20,797 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 08:01:20,797 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 08:01:20,798 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 08:01:20,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:20,799 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 08:01:20,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:20,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:20,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:20,804 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 08:01:20,804 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 08:01:20,805 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 08:01:20,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:20,805 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 08:01:20,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:20,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:20,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:20,807 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 08:01:20,807 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 08:01:20,807 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 08:01:20,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-08 08:01:20,808 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 08:01:20,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 08:01:20,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-08 08:01:20,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-08 08:01:20,808 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 08:01:20,808 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 08:01:20,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 08:01:20,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 08:01:20,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 08:01:20,808 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 08:01:20,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:21,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 08:01:21,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 08:01:21,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 08:01:21,141 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 08:01:21,141 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 08:01:21,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,141 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 08:01:21,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-08 08:01:21,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:01:21,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~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; {5823#(< ~counter~0 10)} is VALID [2022-04-08 08:01:21,149 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 10)} #55#return; {5823#(< ~counter~0 10)} is VALID [2022-04-08 08:01:21,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,149 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,149 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~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)); {5594#true} is VALID [2022-04-08 08:01:21,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-08 08:01:21,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-08 08:01:21,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~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; {5848#(< ~counter~0 9)} is VALID [2022-04-08 08:01:21,151 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 9)} #55#return; {5848#(< ~counter~0 9)} is VALID [2022-04-08 08:01:21,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,151 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~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)); {5594#true} is VALID [2022-04-08 08:01:21,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-08 08:01:21,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-08 08:01:21,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~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; {5873#(< ~counter~0 8)} is VALID [2022-04-08 08:01:21,153 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 8)} #55#return; {5873#(< ~counter~0 8)} is VALID [2022-04-08 08:01:21,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,153 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~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)); {5594#true} is VALID [2022-04-08 08:01:21,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-08 08:01:21,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-08 08:01:21,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~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; {5898#(< ~counter~0 7)} is VALID [2022-04-08 08:01:21,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 7)} #55#return; {5898#(< ~counter~0 7)} is VALID [2022-04-08 08:01:21,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,155 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~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)); {5594#true} is VALID [2022-04-08 08:01:21,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-08 08:01:21,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-08 08:01:21,156 INFO L290 TraceCheckUtils]: 19: 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 08:01:21,156 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:21,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,156 INFO L272 TraceCheckUtils]: 14: 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)); {5594#true} is VALID [2022-04-08 08:01:21,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:21,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:21,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {5711#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5711#(<= ~counter~0 4)} #53#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 08:01:21,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 08:01:21,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 08:01:21,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {5711#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-08 08:01:21,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(<= ~counter~0 4)} 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; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {5711#(<= ~counter~0 4)} call #t~ret6 := main(); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#(<= ~counter~0 4)} {5594#true} #61#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,165 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; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:21,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 08:01:21,165 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 08:01:21,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207140981] [2022-04-08 08:01:21,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603505304] [2022-04-08 08:01:21,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603505304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:21,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:21,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 08:01:21,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985354461] [2022-04-08 08:01:21,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985354461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:21,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:21,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:01:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458017790] [2022-04-08 08:01:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:21,167 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 08:01:21,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:21,168 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 08:01:21,219 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 08:01:21,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:01:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:01:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:01:21,220 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 08:01:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:21,443 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-08 08:01:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:01:21,443 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 08:01:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:21,443 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 08:01:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 08:01:21,446 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 08:01:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 08:01:21,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-08 08:01:21,504 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 08:01:21,505 INFO L225 Difference]: With dead ends: 78 [2022-04-08 08:01:21,505 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 08:01:21,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:01:21,506 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 08:01:21,506 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 08:01:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 08:01:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 08:01:21,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:21,580 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 08:01:21,580 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 08:01:21,580 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 08:01:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:21,582 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 08:01:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 08:01:21,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:21,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:21,582 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 08:01:21,583 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 08:01:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:21,584 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 08:01:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 08:01:21,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:21,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:21,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:21,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:21,584 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 08:01:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-08 08:01:21,585 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-08 08:01:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:21,585 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-08 08:01:21,586 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 08:01:21,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-08 08:01:25,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 08:01:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 08:01:25,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:25,792 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 08:01:25,808 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 08:01:25,992 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 08:01:25,993 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-08 08:01:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [295163144] [2022-04-08 08:01:26,080 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:26,080 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:26,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-08 08:01:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696073501] [2022-04-08 08:01:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:26,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:26,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563766308] [2022-04-08 08:01:26,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:01:26,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:26,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:26,097 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 08:01:26,123 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 08:01:26,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:01:26,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:26,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 08:01:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:26,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:26,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-08 08:01:26,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#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; {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #61#return; {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret6 := main(); {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#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; {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {6423#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6423#true} {6423#true} #53#return; {6423#true} is VALID [2022-04-08 08:01:26,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:26,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:26,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:26,577 INFO L272 TraceCheckUtils]: 14: Hoare triple {6461#(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)); {6423#true} is VALID [2022-04-08 08:01:26,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,578 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6423#true} {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:26,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {6461#(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; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:26,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:26,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:26,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {6486#(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)); {6423#true} is VALID [2022-04-08 08:01:26,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,581 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6423#true} {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:26,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(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; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:26,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:26,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:26,582 INFO L272 TraceCheckUtils]: 30: Hoare triple {6511#(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)); {6423#true} is VALID [2022-04-08 08:01:26,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,583 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6423#true} {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:26,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {6511#(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; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:26,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:26,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:26,592 INFO L272 TraceCheckUtils]: 38: Hoare triple {6536#(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)); {6423#true} is VALID [2022-04-08 08:01:26,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,593 INFO L290 TraceCheckUtils]: 41: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,593 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6423#true} {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:26,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {6536#(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; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:26,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:26,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:26,595 INFO L272 TraceCheckUtils]: 46: Hoare triple {6561#(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)); {6423#true} is VALID [2022-04-08 08:01:26,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,596 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6423#true} {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 08:01:26,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {6561#(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; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 08:01:26,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 08:01:26,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 08:01:26,598 INFO L272 TraceCheckUtils]: 54: Hoare triple {6586#(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)); {6423#true} is VALID [2022-04-08 08:01:26,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,599 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6423#true} {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 08:01:26,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 08:01:26,600 INFO L272 TraceCheckUtils]: 60: Hoare triple {6611#(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)); {6423#true} is VALID [2022-04-08 08:01:26,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 08:01:26,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 08:01:26,600 INFO L290 TraceCheckUtils]: 63: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 08:01:26,600 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6423#true} {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 08:01:26,601 INFO L272 TraceCheckUtils]: 65: Hoare triple {6611#(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)); {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:26,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:26,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {6634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6424#false} is VALID [2022-04-08 08:01:26,602 INFO L290 TraceCheckUtils]: 68: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-08 08:01:26,603 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 08:01:26,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:26,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696073501] [2022-04-08 08:01:26,900 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:26,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563766308] [2022-04-08 08:01:26,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563766308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:26,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:26,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 08:01:26,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [295163144] [2022-04-08 08:01:26,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [295163144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:26,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:26,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:01:26,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118624482] [2022-04-08 08:01:26,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:26,902 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 08:01:26,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:26,902 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 08:01:26,938 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 08:01:26,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:01:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:26,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:01:26,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:01:26,939 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 08:01:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:27,523 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 08:01:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:01:27,524 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 08:01:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:27,524 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 08:01:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 08:01:27,525 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 08:01:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 08:01:27,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 08:01:27,572 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 08:01:27,573 INFO L225 Difference]: With dead ends: 76 [2022-04-08 08:01:27,574 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 08:01:27,574 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 08:01:27,574 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:27,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:01:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 08:01:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 08:01:27,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:27,655 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 08:01:27,655 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 08:01:27,655 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 08:01:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:27,657 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 08:01:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 08:01:27,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:27,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:27,657 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 08:01:27,657 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 08:01:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:27,659 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 08:01:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 08:01:27,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:27,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:27,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:27,660 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 08:01:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 08:01:27,661 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-08 08:01:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:27,661 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 08:01:27,661 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 08:01:27,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 08:01:31,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 08:01:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 08:01:31,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:31,928 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 08:01:31,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 08:01:32,131 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 08:01:32,132 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-08 08:01:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:32,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492691250] [2022-04-08 08:01:32,223 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:32,224 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:32,224 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-08 08:01:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:32,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235735335] [2022-04-08 08:01:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:32,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:32,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199873384] [2022-04-08 08:01:32,240 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:01:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:32,241 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 08:01:32,242 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 08:01:32,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:01:32,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:32,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 08:01:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:32,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:32,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-08 08:01:32,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7144#(<= ~counter~0 0)} {7136#true} #61#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {7144#(<= ~counter~0 0)} call #t~ret6 := main(); {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= ~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; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {7144#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= ~counter~0 0)} ~cond := #in~cond; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= ~counter~0 0)} assume !(0 == ~cond); {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7144#(<= ~counter~0 0)} {7144#(<= ~counter~0 0)} #53#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:32,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,644 INFO L272 TraceCheckUtils]: 14: Hoare triple {7178#(<= ~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)); {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= ~counter~0 1)} ~cond := #in~cond; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {7178#(<= ~counter~0 1)} assume !(0 == ~cond); {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {7178#(<= ~counter~0 1)} assume true; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,645 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7178#(<= ~counter~0 1)} {7178#(<= ~counter~0 1)} #55#return; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {7178#(<= ~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; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:32,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {7178#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {7203#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,647 INFO L272 TraceCheckUtils]: 22: Hoare triple {7203#(<= ~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)); {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {7203#(<= ~counter~0 2)} ~cond := #in~cond; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {7203#(<= ~counter~0 2)} assume !(0 == ~cond); {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {7203#(<= ~counter~0 2)} assume true; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,648 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7203#(<= ~counter~0 2)} {7203#(<= ~counter~0 2)} #55#return; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {7203#(<= ~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; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:32,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {7203#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {7228#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,649 INFO L272 TraceCheckUtils]: 30: Hoare triple {7228#(<= ~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)); {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {7228#(<= ~counter~0 3)} ~cond := #in~cond; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {7228#(<= ~counter~0 3)} assume !(0 == ~cond); {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,652 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7228#(<= ~counter~0 3)} {7228#(<= ~counter~0 3)} #55#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {7228#(<= ~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; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:32,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,654 INFO L272 TraceCheckUtils]: 38: Hoare triple {7253#(<= ~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)); {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {7253#(<= ~counter~0 4)} ~cond := #in~cond; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {7253#(<= ~counter~0 4)} assume !(0 == ~cond); {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {7253#(<= ~counter~0 4)} assume true; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,656 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7253#(<= ~counter~0 4)} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:32,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,658 INFO L272 TraceCheckUtils]: 46: Hoare triple {7278#(<= ~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)); {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {7278#(<= ~counter~0 5)} ~cond := #in~cond; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {7278#(<= ~counter~0 5)} assume !(0 == ~cond); {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {7278#(<= ~counter~0 5)} assume true; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,659 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7278#(<= ~counter~0 5)} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:32,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,661 INFO L272 TraceCheckUtils]: 54: Hoare triple {7303#(<= ~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)); {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {7303#(<= ~counter~0 6)} ~cond := #in~cond; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {7303#(<= ~counter~0 6)} assume !(0 == ~cond); {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {7303#(<= ~counter~0 6)} assume true; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,662 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7303#(<= ~counter~0 6)} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {7303#(<= ~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; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:32,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7328#(<= |main_#t~post5| 6)} is VALID [2022-04-08 08:01:32,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {7328#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-08 08:01:32,663 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {7137#false} assume !(0 == ~cond); {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {7137#false} assume true; {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7137#false} {7137#false} #57#return; {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-08 08:01:32,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-08 08:01:32,664 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 08:01:32,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:33,023 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-08 08:01:33,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-08 08:01:33,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-08 08:01:33,023 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-08 08:01:33,023 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7136#true} {7137#false} #57#return; {7137#false} is VALID [2022-04-08 08:01:33,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,023 INFO L290 TraceCheckUtils]: 64: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,023 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7136#true} is VALID [2022-04-08 08:01:33,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {7386#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-08 08:01:33,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {7390#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7386#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:01:33,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {7390#(< ~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; {7390#(< ~counter~0 10)} is VALID [2022-04-08 08:01:33,025 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7136#true} {7390#(< ~counter~0 10)} #55#return; {7390#(< ~counter~0 10)} is VALID [2022-04-08 08:01:33,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,025 INFO L272 TraceCheckUtils]: 54: Hoare triple {7390#(< ~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)); {7136#true} is VALID [2022-04-08 08:01:33,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {7390#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-08 08:01:33,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {7415#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-08 08:01:33,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {7415#(< ~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; {7415#(< ~counter~0 9)} is VALID [2022-04-08 08:01:33,027 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7415#(< ~counter~0 9)} #55#return; {7415#(< ~counter~0 9)} is VALID [2022-04-08 08:01:33,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,027 INFO L272 TraceCheckUtils]: 46: Hoare triple {7415#(< ~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)); {7136#true} is VALID [2022-04-08 08:01:33,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {7415#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-08 08:01:33,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {7440#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-08 08:01:33,028 INFO L290 TraceCheckUtils]: 43: Hoare triple {7440#(< ~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; {7440#(< ~counter~0 8)} is VALID [2022-04-08 08:01:33,028 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7136#true} {7440#(< ~counter~0 8)} #55#return; {7440#(< ~counter~0 8)} is VALID [2022-04-08 08:01:33,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,029 INFO L272 TraceCheckUtils]: 38: Hoare triple {7440#(< ~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)); {7136#true} is VALID [2022-04-08 08:01:33,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {7440#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-08 08:01:33,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-08 08:01:33,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {7303#(<= ~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; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:33,030 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7136#true} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:33,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,030 INFO L272 TraceCheckUtils]: 30: Hoare triple {7303#(<= ~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)); {7136#true} is VALID [2022-04-08 08:01:33,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:33,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:33,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:33,032 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7136#true} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:33,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,032 INFO L272 TraceCheckUtils]: 22: Hoare triple {7278#(<= ~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)); {7136#true} is VALID [2022-04-08 08:01:33,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:33,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:33,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:33,033 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7136#true} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:33,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,034 INFO L272 TraceCheckUtils]: 14: Hoare triple {7253#(<= ~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)); {7136#true} is VALID [2022-04-08 08:01:33,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:33,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:33,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {7228#(<= ~counter~0 3)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7228#(<= ~counter~0 3)} #53#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 08:01:33,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 08:01:33,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 08:01:33,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {7228#(<= ~counter~0 3)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-08 08:01:33,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#(<= ~counter~0 3)} 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; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#(<= ~counter~0 3)} call #t~ret6 := main(); {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#(<= ~counter~0 3)} {7136#true} #61#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:33,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-08 08:01:33,037 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 08:01:33,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:33,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235735335] [2022-04-08 08:01:33,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:33,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199873384] [2022-04-08 08:01:33,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199873384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:33,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:33,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 08:01:33,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:33,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1492691250] [2022-04-08 08:01:33,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1492691250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:33,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:33,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:01:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039811321] [2022-04-08 08:01:33,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:33,039 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 08:01:33,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:33,039 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 08:01:33,097 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 08:01:33,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:01:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:01:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:01:33,098 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 08:01:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:33,366 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-08 08:01:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 08:01:33,366 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 08:01:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:33,367 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 08:01:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 08:01:33,371 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 08:01:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 08:01:33,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-08 08:01:33,436 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:01:33,437 INFO L225 Difference]: With dead ends: 86 [2022-04-08 08:01:33,437 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 08:01:33,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:01:33,438 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:33,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:01:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 08:01:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 08:01:33,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:33,526 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 08:01:33,526 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 08:01:33,526 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 08:01:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:33,529 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 08:01:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 08:01:33,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:33,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:33,530 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 08:01:33,530 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 08:01:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:33,531 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 08:01:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 08:01:33,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:33,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:33,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:33,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:33,534 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 08:01:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-08 08:01:33,536 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-08 08:01:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:33,536 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-08 08:01:33,536 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 08:01:33,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-08 08:01:37,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 08:01:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:01:37,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:37,963 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 08:01:37,980 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 08:01:38,163 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 08:01:38,164 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-08 08:01:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:38,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679913154] [2022-04-08 08:01:38,276 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:38,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:38,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-08 08:01:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:38,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089305731] [2022-04-08 08:01:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:38,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:38,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873453969] [2022-04-08 08:01:38,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:01:38,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:38,290 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 08:01:38,291 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 08:01:43,840 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 08:01:43,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:43,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 08:01:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:43,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:44,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {8063#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; {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8063#true} {8063#true} #61#return; {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {8063#true} call #t~ret6 := main(); {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {8063#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; {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {8063#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8063#true} {8063#true} #53#return; {8063#true} is VALID [2022-04-08 08:01:44,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {8063#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:44,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:44,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:44,409 INFO L272 TraceCheckUtils]: 14: Hoare triple {8101#(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)); {8063#true} is VALID [2022-04-08 08:01:44,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,410 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:44,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {8101#(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; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:44,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:44,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:44,411 INFO L272 TraceCheckUtils]: 22: Hoare triple {8126#(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)); {8063#true} is VALID [2022-04-08 08:01:44,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,412 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8063#true} {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:01:44,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {8126#(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; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:44,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:44,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:44,413 INFO L272 TraceCheckUtils]: 30: Hoare triple {8151#(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)); {8063#true} is VALID [2022-04-08 08:01:44,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,414 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8063#true} {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 08:01:44,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {8151#(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; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:44,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:44,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:44,417 INFO L272 TraceCheckUtils]: 38: Hoare triple {8176#(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)); {8063#true} is VALID [2022-04-08 08:01:44,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,418 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8063#true} {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 08:01:44,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {8176#(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; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:44,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:44,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:44,419 INFO L272 TraceCheckUtils]: 46: Hoare triple {8201#(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)); {8063#true} is VALID [2022-04-08 08:01:44,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,420 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8063#true} {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:01:44,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {8201#(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; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 08:01:44,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 08:01:44,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 10);havoc #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 08:01:44,421 INFO L272 TraceCheckUtils]: 54: Hoare triple {8226#(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)); {8063#true} is VALID [2022-04-08 08:01:44,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,422 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8063#true} {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 08:01:44,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {8226#(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; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 08:01:44,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 08:01:44,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 08:01:44,423 INFO L272 TraceCheckUtils]: 62: Hoare triple {8251#(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)); {8063#true} is VALID [2022-04-08 08:01:44,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,423 INFO L290 TraceCheckUtils]: 65: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,423 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8063#true} {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 08:01:44,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 08:01:44,424 INFO L272 TraceCheckUtils]: 68: Hoare triple {8276#(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)); {8063#true} is VALID [2022-04-08 08:01:44,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 08:01:44,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 08:01:44,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 08:01:44,425 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8063#true} {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 08:01:44,425 INFO L272 TraceCheckUtils]: 73: Hoare triple {8276#(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)); {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:44,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:44,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {8299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8064#false} is VALID [2022-04-08 08:01:44,426 INFO L290 TraceCheckUtils]: 76: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2022-04-08 08:01:44,426 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 08:01:44,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089305731] [2022-04-08 08:01:45,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:45,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873453969] [2022-04-08 08:01:45,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873453969] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:45,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:45,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 08:01:45,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:45,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679913154] [2022-04-08 08:01:45,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679913154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:45,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:45,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:01:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478880093] [2022-04-08 08:01:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:45,116 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 08:01:45,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:45,116 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 08:01:45,159 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 08:01:45,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:01:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:01:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 08:01:45,161 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 08:01:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:46,035 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-08 08:01:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 08:01:46,035 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 08:01:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:46,036 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 08:01:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 08:01:46,037 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 08:01:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 08:01:46,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 08:01:46,096 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 08:01:46,097 INFO L225 Difference]: With dead ends: 84 [2022-04-08 08:01:46,097 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 08:01:46,097 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 08:01:46,098 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:46,098 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.3s Time] [2022-04-08 08:01:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 08:01:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 08:01:46,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:46,196 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 08:01:46,196 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 08:01:46,196 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 08:01:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:46,197 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 08:01:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 08:01:46,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:46,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:46,198 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 08:01:46,198 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 08:01:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:46,199 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 08:01:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 08:01:46,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:46,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:46,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:46,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:46,199 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 08:01:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 08:01:46,201 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-08 08:01:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:46,201 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 08:01:46,201 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 08:01:46,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 08:01:50,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 08:01:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 08:01:50,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:50,715 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 08:01:50,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 08:01:50,919 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 08:01:50,919 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-08 08:01:50,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:50,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948253948] [2022-04-08 08:01:51,022 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:51,022 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:51,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-08 08:01:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:51,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888330825] [2022-04-08 08:01:51,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:51,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:51,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965992933] [2022-04-08 08:01:51,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:01:51,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:51,050 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 08:01:51,058 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 08:01:51,224 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 08:01:51,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:51,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 08:01:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:51,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:51,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-08 08:01:51,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8957#(<= ~counter~0 0)} {8949#true} #61#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {8957#(<= ~counter~0 0)} call #t~ret6 := main(); {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {8957#(<= ~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; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {8957#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {8957#(<= ~counter~0 0)} ~cond := #in~cond; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {8957#(<= ~counter~0 0)} assume !(0 == ~cond); {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8957#(<= ~counter~0 0)} {8957#(<= ~counter~0 0)} #53#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {8957#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 08:01:51,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {8991#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,602 INFO L272 TraceCheckUtils]: 14: Hoare triple {8991#(<= ~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)); {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {8991#(<= ~counter~0 1)} ~cond := #in~cond; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {8991#(<= ~counter~0 1)} assume !(0 == ~cond); {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {8991#(<= ~counter~0 1)} assume true; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,604 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8991#(<= ~counter~0 1)} {8991#(<= ~counter~0 1)} #55#return; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {8991#(<= ~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; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 08:01:51,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {8991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {9016#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,605 INFO L272 TraceCheckUtils]: 22: Hoare triple {9016#(<= ~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)); {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {9016#(<= ~counter~0 2)} ~cond := #in~cond; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {9016#(<= ~counter~0 2)} assume !(0 == ~cond); {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,606 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9016#(<= ~counter~0 2)} {9016#(<= ~counter~0 2)} #55#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {9016#(<= ~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; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,608 INFO L272 TraceCheckUtils]: 30: Hoare triple {9041#(<= ~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)); {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#(<= ~counter~0 3)} ~cond := #in~cond; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#(<= ~counter~0 3)} assume !(0 == ~cond); {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#(<= ~counter~0 3)} assume true; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,609 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9041#(<= ~counter~0 3)} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,611 INFO L272 TraceCheckUtils]: 38: Hoare triple {9066#(<= ~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)); {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {9066#(<= ~counter~0 4)} ~cond := #in~cond; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {9066#(<= ~counter~0 4)} assume !(0 == ~cond); {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {9066#(<= ~counter~0 4)} assume true; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,612 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9066#(<= ~counter~0 4)} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,613 INFO L272 TraceCheckUtils]: 46: Hoare triple {9091#(<= ~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)); {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {9091#(<= ~counter~0 5)} ~cond := #in~cond; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {9091#(<= ~counter~0 5)} assume !(0 == ~cond); {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {9091#(<= ~counter~0 5)} assume true; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,615 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9091#(<= ~counter~0 5)} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,616 INFO L272 TraceCheckUtils]: 54: Hoare triple {9116#(<= ~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)); {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,616 INFO L290 TraceCheckUtils]: 55: Hoare triple {9116#(<= ~counter~0 6)} ~cond := #in~cond; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {9116#(<= ~counter~0 6)} assume !(0 == ~cond); {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {9116#(<= ~counter~0 6)} assume true; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,617 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9116#(<= ~counter~0 6)} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {9116#(<= ~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; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,619 INFO L272 TraceCheckUtils]: 62: Hoare triple {9141#(<= ~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)); {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {9141#(<= ~counter~0 7)} ~cond := #in~cond; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {9141#(<= ~counter~0 7)} assume !(0 == ~cond); {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,620 INFO L290 TraceCheckUtils]: 65: Hoare triple {9141#(<= ~counter~0 7)} assume true; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,620 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9141#(<= ~counter~0 7)} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {9141#(<= ~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; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9166#(<= |main_#t~post5| 7)} is VALID [2022-04-08 08:01:51,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {9166#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-08 08:01:51,621 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8950#false} is VALID [2022-04-08 08:01:51,621 INFO L290 TraceCheckUtils]: 71: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-08 08:01:51,621 INFO L290 TraceCheckUtils]: 72: Hoare triple {8950#false} assume !(0 == ~cond); {8950#false} is VALID [2022-04-08 08:01:51,621 INFO L290 TraceCheckUtils]: 73: Hoare triple {8950#false} assume true; {8950#false} is VALID [2022-04-08 08:01:51,621 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8950#false} {8950#false} #57#return; {8950#false} is VALID [2022-04-08 08:01:51,622 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-08 08:01:51,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-08 08:01:51,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-08 08:01:51,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-08 08:01:51,622 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 08:01:51,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:51,978 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-08 08:01:51,978 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-08 08:01:51,978 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-08 08:01:51,978 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-08 08:01:51,978 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8949#true} {8950#false} #57#return; {8950#false} is VALID [2022-04-08 08:01:51,978 INFO L290 TraceCheckUtils]: 73: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,978 INFO L290 TraceCheckUtils]: 71: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,978 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8949#true} is VALID [2022-04-08 08:01:51,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {9224#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-08 08:01:51,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {9228#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:01:51,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {9228#(< ~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; {9228#(< ~counter~0 10)} is VALID [2022-04-08 08:01:51,980 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8949#true} {9228#(< ~counter~0 10)} #55#return; {9228#(< ~counter~0 10)} is VALID [2022-04-08 08:01:51,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,980 INFO L272 TraceCheckUtils]: 62: Hoare triple {9228#(< ~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)); {8949#true} is VALID [2022-04-08 08:01:51,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {9228#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-08 08:01:51,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {9253#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-08 08:01:51,981 INFO L290 TraceCheckUtils]: 59: Hoare triple {9253#(< ~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; {9253#(< ~counter~0 9)} is VALID [2022-04-08 08:01:51,982 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8949#true} {9253#(< ~counter~0 9)} #55#return; {9253#(< ~counter~0 9)} is VALID [2022-04-08 08:01:51,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,982 INFO L272 TraceCheckUtils]: 54: Hoare triple {9253#(< ~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)); {8949#true} is VALID [2022-04-08 08:01:51,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {9253#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-08 08:01:51,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-08 08:01:51,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {9141#(<= ~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; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,983 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8949#true} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,984 INFO L272 TraceCheckUtils]: 46: Hoare triple {9141#(<= ~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)); {8949#true} is VALID [2022-04-08 08:01:51,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 08:01:51,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {9116#(<= ~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; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,985 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8949#true} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,985 INFO L272 TraceCheckUtils]: 38: Hoare triple {9116#(<= ~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)); {8949#true} is VALID [2022-04-08 08:01:51,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 08:01:51,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,987 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8949#true} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,987 INFO L272 TraceCheckUtils]: 30: Hoare triple {9091#(<= ~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)); {8949#true} is VALID [2022-04-08 08:01:51,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 08:01:51,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,989 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8949#true} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,989 INFO L272 TraceCheckUtils]: 22: Hoare triple {9066#(<= ~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)); {8949#true} is VALID [2022-04-08 08:01:51,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 08:01:51,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,990 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8949#true} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,991 INFO L272 TraceCheckUtils]: 14: Hoare triple {9041#(<= ~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)); {8949#true} is VALID [2022-04-08 08:01:51,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 08:01:51,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {9016#(<= ~counter~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8949#true} {9016#(<= ~counter~0 2)} #53#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 08:01:51,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 08:01:51,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 08:01:51,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {9016#(<= ~counter~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8949#true} is VALID [2022-04-08 08:01:51,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {9016#(<= ~counter~0 2)} 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; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {9016#(<= ~counter~0 2)} call #t~ret6 := main(); {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9016#(<= ~counter~0 2)} {8949#true} #61#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 08:01:51,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-08 08:01:51,998 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 08:01:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:51,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888330825] [2022-04-08 08:01:51,999 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:51,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965992933] [2022-04-08 08:01:51,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965992933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:01:51,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:01:51,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 08:01:51,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:51,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948253948] [2022-04-08 08:01:51,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948253948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:51,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:51,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 08:01:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934345496] [2022-04-08 08:01:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:52,003 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 08:01:52,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:52,004 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 08:01:52,069 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 08:01:52,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 08:01:52,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 08:01:52,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:01:52,070 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 08:01:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:52,393 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-08 08:01:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 08:01:52,393 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 08:01:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:52,394 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 08:01:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 08:01:52,396 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 08:01:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 08:01:52,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-08 08:01:52,482 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:52,483 INFO L225 Difference]: With dead ends: 94 [2022-04-08 08:01:52,483 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 08:01:52,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-08 08:01:52,484 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:52,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:01:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 08:01:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 08:01:52,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:52,585 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 08:01:52,585 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 08:01:52,585 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 08:01:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:52,586 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 08:01:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 08:01:52,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:52,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:52,587 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 08:01:52,587 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 08:01:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:52,590 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 08:01:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 08:01:52,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:52,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:52,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:52,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:52,590 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 08:01:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-08 08:01:52,592 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-08 08:01:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:52,592 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-08 08:01:52,592 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 08:01:52,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-08 08:01:57,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 08:01:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 08:01:57,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:57,086 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 08:01:57,094 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 08:01:57,291 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 08:01:57,291 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:57,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-08 08:01:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:57,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568646270] [2022-04-08 08:01:57,396 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:57,397 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:01:57,397 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:01:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-08 08:01:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:57,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333703760] [2022-04-08 08:01:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:57,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:57,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898801752] [2022-04-08 08:01:57,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:57,413 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 08:01:57,422 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 08:01:58,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:58,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:58,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 08:01:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:58,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:59,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {9974#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; {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #61#return; {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret6 := main(); {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {9974#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; {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {9974#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9974#true} {9974#true} #53#return; {9974#true} is VALID [2022-04-08 08:01:59,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {9974#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:59,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:59,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:59,116 INFO L272 TraceCheckUtils]: 14: Hoare triple {10012#(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)); {9974#true} is VALID [2022-04-08 08:01:59,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,116 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9974#true} {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:01:59,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {10012#(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; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:59,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:59,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:59,117 INFO L272 TraceCheckUtils]: 22: Hoare triple {10037#(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)); {9974#true} is VALID [2022-04-08 08:01:59,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,118 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9974#true} {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 08:01:59,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {10037#(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; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 08:01:59,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 08:01:59,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 08:01:59,119 INFO L272 TraceCheckUtils]: 30: Hoare triple {10062#(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)); {9974#true} is VALID [2022-04-08 08:01:59,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,120 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9974#true} {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 08:01:59,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {10062#(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; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:01:59,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:01:59,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:01:59,121 INFO L272 TraceCheckUtils]: 38: Hoare triple {10087#(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)); {9974#true} is VALID [2022-04-08 08:01:59,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,122 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9974#true} {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:01:59,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {10087#(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; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:01:59,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:01:59,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:01:59,123 INFO L272 TraceCheckUtils]: 46: Hoare triple {10112#(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)); {9974#true} is VALID [2022-04-08 08:01:59,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,123 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9974#true} {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 08:01:59,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {10112#(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; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,124 INFO L290 TraceCheckUtils]: 52: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,125 INFO L290 TraceCheckUtils]: 53: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,125 INFO L272 TraceCheckUtils]: 54: Hoare triple {10137#(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)); {9974#true} is VALID [2022-04-08 08:01:59,125 INFO L290 TraceCheckUtils]: 55: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,125 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9974#true} {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {10137#(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; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,127 INFO L272 TraceCheckUtils]: 62: Hoare triple {10162#(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)); {9974#true} is VALID [2022-04-08 08:01:59,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,128 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9974#true} {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 08:01:59,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {10162#(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; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 08:01:59,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 08:01:59,129 INFO L290 TraceCheckUtils]: 69: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 08:01:59,129 INFO L272 TraceCheckUtils]: 70: Hoare triple {10187#(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)); {9974#true} is VALID [2022-04-08 08:01:59,129 INFO L290 TraceCheckUtils]: 71: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,129 INFO L290 TraceCheckUtils]: 72: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,129 INFO L290 TraceCheckUtils]: 73: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,129 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9974#true} {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 08:01:59,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 08:01:59,130 INFO L272 TraceCheckUtils]: 76: Hoare triple {10212#(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)); {9974#true} is VALID [2022-04-08 08:01:59,130 INFO L290 TraceCheckUtils]: 77: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 08:01:59,130 INFO L290 TraceCheckUtils]: 78: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 08:01:59,130 INFO L290 TraceCheckUtils]: 79: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 08:01:59,131 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9974#true} {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 08:01:59,131 INFO L272 TraceCheckUtils]: 81: Hoare triple {10212#(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)); {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:59,132 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:59,132 INFO L290 TraceCheckUtils]: 83: Hoare triple {10235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9975#false} is VALID [2022-04-08 08:01:59,132 INFO L290 TraceCheckUtils]: 84: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2022-04-08 08:01:59,132 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 08:01:59,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:01:59,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:59,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333703760] [2022-04-08 08:01:59,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:59,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898801752] [2022-04-08 08:01:59,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898801752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:01:59,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:01:59,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 08:01:59,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:59,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568646270] [2022-04-08 08:01:59,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568646270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:59,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:59,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:01:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014732525] [2022-04-08 08:01:59,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:59,501 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 08:01:59,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:59,501 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 08:01:59,549 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 08:01:59,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:01:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:59,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:01:59,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 08:01:59,550 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 08:02:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:00,560 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-08 08:02:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 08:02:00,560 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 08:02:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:02:00,561 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 08:02:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 08:02:00,562 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 08:02:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 08:02:00,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 08:02:00,645 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 08:02:00,647 INFO L225 Difference]: With dead ends: 92 [2022-04-08 08:02:00,647 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 08:02:00,647 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 08:02:00,647 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:02:00,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:02:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 08:02:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 08:02:00,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:02:00,757 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 08:02:00,757 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 08:02:00,757 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 08:02:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:00,759 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 08:02:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 08:02:00,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:00,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:00,760 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 08:02:00,760 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 08:02:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:00,762 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 08:02:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 08:02:00,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:00,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:00,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:02:00,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:02:00,762 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 08:02:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-08 08:02:00,764 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-08 08:02:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:02:00,764 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-08 08:02:00,765 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 08:02:00,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-08 08:02:05,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:02:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 08:02:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 08:02:05,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:02:05,291 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 08:02:05,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 08:02:05,499 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 08:02:05,499 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:02:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:02:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-08 08:02:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:05,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589830657] [2022-04-08 08:02:05,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:02:05,607 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:02:05,607 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:02:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-08 08:02:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:02:05,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739619877] [2022-04-08 08:02:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:02:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:02:05,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:02:05,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663756462] [2022-04-08 08:02:05,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:02:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:02:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:02:05,628 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 08:02:05,655 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 08:02:05,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:02:05,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:02:05,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 08:02:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:02:05,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:02:06,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-08 08:02:06,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10841#(<= ~counter~0 0)} {10833#true} #61#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {10841#(<= ~counter~0 0)} call #t~ret6 := main(); {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {10841#(<= ~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; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {10841#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {10841#(<= ~counter~0 0)} ~cond := #in~cond; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {10841#(<= ~counter~0 0)} assume !(0 == ~cond); {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10841#(<= ~counter~0 0)} {10841#(<= ~counter~0 0)} #53#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {10841#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:06,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {10841#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {10875#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,170 INFO L272 TraceCheckUtils]: 14: Hoare triple {10875#(<= ~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)); {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {10875#(<= ~counter~0 1)} ~cond := #in~cond; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {10875#(<= ~counter~0 1)} assume !(0 == ~cond); {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,171 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10875#(<= ~counter~0 1)} {10875#(<= ~counter~0 1)} #55#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {10875#(<= ~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; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,172 INFO L272 TraceCheckUtils]: 22: Hoare triple {10900#(<= ~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)); {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {10900#(<= ~counter~0 2)} ~cond := #in~cond; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {10900#(<= ~counter~0 2)} assume !(0 == ~cond); {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {10900#(<= ~counter~0 2)} assume true; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,174 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10900#(<= ~counter~0 2)} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,175 INFO L272 TraceCheckUtils]: 30: Hoare triple {10925#(<= ~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)); {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {10925#(<= ~counter~0 3)} ~cond := #in~cond; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(<= ~counter~0 3)} assume !(0 == ~cond); {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {10925#(<= ~counter~0 3)} assume true; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,176 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10925#(<= ~counter~0 3)} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,178 INFO L272 TraceCheckUtils]: 38: Hoare triple {10950#(<= ~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)); {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {10950#(<= ~counter~0 4)} ~cond := #in~cond; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {10950#(<= ~counter~0 4)} assume !(0 == ~cond); {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {10950#(<= ~counter~0 4)} assume true; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,179 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10950#(<= ~counter~0 4)} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,181 INFO L272 TraceCheckUtils]: 46: Hoare triple {10975#(<= ~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)); {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {10975#(<= ~counter~0 5)} ~cond := #in~cond; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {10975#(<= ~counter~0 5)} assume !(0 == ~cond); {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {10975#(<= ~counter~0 5)} assume true; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,182 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10975#(<= ~counter~0 5)} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,184 INFO L272 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~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)); {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {11000#(<= ~counter~0 6)} ~cond := #in~cond; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 6)} assume !(0 == ~cond); {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 6)} assume true; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,185 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11000#(<= ~counter~0 6)} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,185 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,187 INFO L272 TraceCheckUtils]: 62: Hoare triple {11025#(<= ~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)); {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,187 INFO L290 TraceCheckUtils]: 63: Hoare triple {11025#(<= ~counter~0 7)} ~cond := #in~cond; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {11025#(<= ~counter~0 7)} assume !(0 == ~cond); {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {11025#(<= ~counter~0 7)} assume true; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,188 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11025#(<= ~counter~0 7)} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {11025#(<= ~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; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,189 INFO L290 TraceCheckUtils]: 68: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,192 INFO L272 TraceCheckUtils]: 70: Hoare triple {11050#(<= ~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)); {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,192 INFO L290 TraceCheckUtils]: 71: Hoare triple {11050#(<= ~counter~0 8)} ~cond := #in~cond; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {11050#(<= ~counter~0 8)} assume !(0 == ~cond); {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,193 INFO L290 TraceCheckUtils]: 73: Hoare triple {11050#(<= ~counter~0 8)} assume true; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,194 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11050#(<= ~counter~0 8)} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,194 INFO L290 TraceCheckUtils]: 75: Hoare triple {11050#(<= ~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; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11075#(<= |main_#t~post5| 8)} is VALID [2022-04-08 08:02:06,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {11075#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-08 08:02:06,195 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10834#false} is VALID [2022-04-08 08:02:06,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L290 TraceCheckUtils]: 80: Hoare triple {10834#false} assume !(0 == ~cond); {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L290 TraceCheckUtils]: 81: Hoare triple {10834#false} assume true; {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10834#false} {10834#false} #57#return; {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-08 08:02:06,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-08 08:02:06,196 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 08:02:06,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:02:06,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-08 08:02:06,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-08 08:02:06,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-08 08:02:06,591 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-08 08:02:06,591 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10833#true} {10834#false} #57#return; {10834#false} is VALID [2022-04-08 08:02:06,591 INFO L290 TraceCheckUtils]: 81: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,591 INFO L290 TraceCheckUtils]: 80: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,591 INFO L290 TraceCheckUtils]: 79: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,591 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10833#true} is VALID [2022-04-08 08:02:06,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {11133#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-08 08:02:06,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {11137#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11133#(< |main_#t~post5| 10)} is VALID [2022-04-08 08:02:06,592 INFO L290 TraceCheckUtils]: 75: Hoare triple {11137#(< ~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; {11137#(< ~counter~0 10)} is VALID [2022-04-08 08:02:06,592 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10833#true} {11137#(< ~counter~0 10)} #55#return; {11137#(< ~counter~0 10)} is VALID [2022-04-08 08:02:06,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,593 INFO L272 TraceCheckUtils]: 70: Hoare triple {11137#(< ~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)); {10833#true} is VALID [2022-04-08 08:02:06,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {11137#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-08 08:02:06,594 INFO L290 TraceCheckUtils]: 68: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-08 08:02:06,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {11050#(<= ~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; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,595 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10833#true} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,596 INFO L272 TraceCheckUtils]: 62: Hoare triple {11050#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,597 INFO L290 TraceCheckUtils]: 60: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:06,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {11025#(<= ~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; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,598 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10833#true} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,598 INFO L272 TraceCheckUtils]: 54: Hoare triple {11025#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:06,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~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; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,600 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10833#true} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,600 INFO L290 TraceCheckUtils]: 47: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,601 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:06,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,603 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10833#true} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,603 INFO L272 TraceCheckUtils]: 38: Hoare triple {10975#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:06,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,605 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10833#true} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,605 INFO L272 TraceCheckUtils]: 30: Hoare triple {10950#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:06,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,607 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10833#true} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,608 INFO L272 TraceCheckUtils]: 22: Hoare triple {10925#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:06,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,610 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10833#true} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,610 INFO L272 TraceCheckUtils]: 14: Hoare triple {10900#(<= ~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)); {10833#true} is VALID [2022-04-08 08:02:06,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:06,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {10875#(<= ~counter~0 1)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10833#true} {10875#(<= ~counter~0 1)} #53#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 08:02:06,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 08:02:06,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 08:02:06,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {10875#(<= ~counter~0 1)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10833#true} is VALID [2022-04-08 08:02:06,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {10875#(<= ~counter~0 1)} 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; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {10875#(<= ~counter~0 1)} call #t~ret6 := main(); {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10875#(<= ~counter~0 1)} {10833#true} #61#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:06,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-08 08:02:06,615 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 08:02:06,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:02:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739619877] [2022-04-08 08:02:06,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:02:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663756462] [2022-04-08 08:02:06,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663756462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:02:06,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:02:06,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 08:02:06,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:02:06,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589830657] [2022-04-08 08:02:06,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589830657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:02:06,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:02:06,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 08:02:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982809146] [2022-04-08 08:02:06,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:02:06,617 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 08:02:06,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:02:06,617 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 08:02:06,687 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:02:06,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 08:02:06,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 08:02:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:02:06,688 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 08:02:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:07,046 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-08 08:02:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 08:02:07,046 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 08:02:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:02:07,046 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 08:02:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 08:02:07,049 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 08:02:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 08:02:07,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-08 08:02:07,144 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:02:07,146 INFO L225 Difference]: With dead ends: 102 [2022-04-08 08:02:07,146 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 08:02:07,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-08 08:02:07,147 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:02:07,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:02:07,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 08:02:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 08:02:07,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:02:07,292 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 08:02:07,292 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 08:02:07,292 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 08:02:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:07,294 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 08:02:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 08:02:07,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:07,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:07,295 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 08:02:07,295 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 08:02:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:07,296 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 08:02:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 08:02:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:07,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:07,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:02:07,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:02:07,297 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 08:02:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-08 08:02:07,299 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-08 08:02:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:02:07,299 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-08 08:02:07,299 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 08:02:07,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-08 08:02:11,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:02:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 08:02:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 08:02:11,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:02:11,897 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 08:02:11,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 08:02:12,097 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 08:02:12,097 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:02:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:02:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-08 08:02:12,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:12,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26232957] [2022-04-08 08:02:12,186 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:02:12,186 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:02:12,186 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:02:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-08 08:02:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:02:12,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977975096] [2022-04-08 08:02:12,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:02:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:02:12,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:02:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280251071] [2022-04-08 08:02:12,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:02:12,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:02:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:02:12,215 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 08:02:12,218 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 08:02:12,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:02:12,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:02:12,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 08:02:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:02:12,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:02:12,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {11956#true} call ULTIMATE.init(); {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {11956#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; {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11956#true} {11956#true} #61#return; {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {11956#true} call #t~ret6 := main(); {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {11956#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; {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {11956#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11956#true} {11956#true} #53#return; {11956#true} is VALID [2022-04-08 08:02:12,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {11956#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:02:12,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:02:12,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:02:12,779 INFO L272 TraceCheckUtils]: 14: Hoare triple {11994#(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)); {11956#true} is VALID [2022-04-08 08:02:12,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,779 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11956#true} {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:02:12,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {11994#(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; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:02:12,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:02:12,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:02:12,780 INFO L272 TraceCheckUtils]: 22: Hoare triple {12019#(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)); {11956#true} is VALID [2022-04-08 08:02:12,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,781 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11956#true} {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 08:02:12,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {12019#(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; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 08:02:12,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 08:02:12,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 08:02:12,782 INFO L272 TraceCheckUtils]: 30: Hoare triple {12044#(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)); {11956#true} is VALID [2022-04-08 08:02:12,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,783 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11956#true} {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 08:02:12,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {12044#(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; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:02:12,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:02:12,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:02:12,784 INFO L272 TraceCheckUtils]: 38: Hoare triple {12069#(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)); {11956#true} is VALID [2022-04-08 08:02:12,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,785 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11956#true} {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 08:02:12,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {12069#(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; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:02:12,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:02:12,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:02:12,786 INFO L272 TraceCheckUtils]: 46: Hoare triple {12094#(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)); {11956#true} is VALID [2022-04-08 08:02:12,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,786 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11956#true} {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:02:12,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {12094#(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; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 08:02:12,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 08:02:12,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 08:02:12,787 INFO L272 TraceCheckUtils]: 54: Hoare triple {12119#(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)); {11956#true} is VALID [2022-04-08 08:02:12,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,788 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11956#true} {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 08:02:12,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {12119#(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; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 08:02:12,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 08:02:12,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 08:02:12,789 INFO L272 TraceCheckUtils]: 62: Hoare triple {12144#(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)); {11956#true} is VALID [2022-04-08 08:02:12,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,790 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11956#true} {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 08:02:12,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {12144#(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; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:02:12,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:02:12,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:02:12,791 INFO L272 TraceCheckUtils]: 70: Hoare triple {12169#(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)); {11956#true} is VALID [2022-04-08 08:02:12,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,791 INFO L290 TraceCheckUtils]: 72: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,792 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11956#true} {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:02:12,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {12169#(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; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 08:02:12,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 08:02:12,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 08:02:12,793 INFO L272 TraceCheckUtils]: 78: Hoare triple {12194#(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)); {11956#true} is VALID [2022-04-08 08:02:12,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,793 INFO L290 TraceCheckUtils]: 80: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,793 INFO L290 TraceCheckUtils]: 81: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,793 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11956#true} {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 08:02:12,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 08:02:12,794 INFO L272 TraceCheckUtils]: 84: Hoare triple {12219#(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)); {11956#true} is VALID [2022-04-08 08:02:12,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 08:02:12,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 08:02:12,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 08:02:12,795 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11956#true} {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 08:02:12,795 INFO L272 TraceCheckUtils]: 89: Hoare triple {12219#(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)); {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:02:12,796 INFO L290 TraceCheckUtils]: 90: Hoare triple {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:02:12,796 INFO L290 TraceCheckUtils]: 91: Hoare triple {12242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11957#false} is VALID [2022-04-08 08:02:12,796 INFO L290 TraceCheckUtils]: 92: Hoare triple {11957#false} assume !false; {11957#false} is VALID [2022-04-08 08:02:12,796 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 08:02:12,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:02:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:02:13,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977975096] [2022-04-08 08:02:13,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:02:13,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280251071] [2022-04-08 08:02:13,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280251071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:02:13,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:02:13,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 08:02:13,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:02:13,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [26232957] [2022-04-08 08:02:13,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [26232957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:02:13,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:02:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 08:02:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378226780] [2022-04-08 08:02:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:02:13,093 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 08:02:13,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:02:13,094 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 08:02:13,146 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 08:02:13,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 08:02:13,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 08:02:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 08:02:13,147 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 08:02:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:14,338 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-08 08:02:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 08:02:14,338 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 08:02:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:02:14,338 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 08:02:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 08:02:14,340 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 08:02:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 08:02:14,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-08 08:02:14,403 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 08:02:14,404 INFO L225 Difference]: With dead ends: 100 [2022-04-08 08:02:14,404 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 08:02:14,405 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 08:02:14,405 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:02:14,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 08:02:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 08:02:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 08:02:14,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:02:14,525 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 08:02:14,525 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 08:02:14,526 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 08:02:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:14,527 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 08:02:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 08:02:14,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:14,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:14,528 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 08:02:14,528 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 08:02:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:14,530 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 08:02:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 08:02:14,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:14,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:14,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:02:14,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:02:14,531 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 08:02:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-08 08:02:14,532 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-08 08:02:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:02:14,532 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-08 08:02:14,533 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 08:02:14,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-08 08:02:19,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:02:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 08:02:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 08:02:19,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:02:19,169 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 08:02:19,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 08:02:19,394 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 08:02:19,394 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:02:19,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:02:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-08 08:02:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:19,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090912121] [2022-04-08 08:02:19,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:02:19,492 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:02:19,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:02:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-08 08:02:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:02:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053334789] [2022-04-08 08:02:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:02:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:02:19,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:02:19,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401195837] [2022-04-08 08:02:19,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 08:02:19,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:02:19,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:02:19,509 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 08:02:19,509 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 08:02:19,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 08:02:19,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:02:19,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 08:02:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:02:19,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:02:20,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-08 08:02:20,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {12896#(<= ~counter~0 0)} ~cond := #in~cond; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {12896#(<= ~counter~0 0)} assume !(0 == ~cond); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12896#(<= ~counter~0 0)} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,061 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {12930#(<= ~counter~0 1)} ~cond := #in~cond; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {12930#(<= ~counter~0 1)} assume !(0 == ~cond); {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= ~counter~0 1)} assume true; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,063 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12930#(<= ~counter~0 1)} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,064 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {12955#(<= ~counter~0 2)} ~cond := #in~cond; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {12955#(<= ~counter~0 2)} assume !(0 == ~cond); {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= ~counter~0 2)} assume true; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,065 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12955#(<= ~counter~0 2)} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,067 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {12980#(<= ~counter~0 3)} ~cond := #in~cond; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {12980#(<= ~counter~0 3)} assume !(0 == ~cond); {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {12980#(<= ~counter~0 3)} assume true; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,068 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12980#(<= ~counter~0 3)} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,070 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {13005#(<= ~counter~0 4)} ~cond := #in~cond; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {13005#(<= ~counter~0 4)} assume !(0 == ~cond); {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {13005#(<= ~counter~0 4)} assume true; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,071 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13005#(<= ~counter~0 4)} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,073 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {13030#(<= ~counter~0 5)} ~cond := #in~cond; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {13030#(<= ~counter~0 5)} assume !(0 == ~cond); {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {13030#(<= ~counter~0 5)} assume true; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,074 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13030#(<= ~counter~0 5)} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,076 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~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)); {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {13055#(<= ~counter~0 6)} ~cond := #in~cond; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {13055#(<= ~counter~0 6)} assume !(0 == ~cond); {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {13055#(<= ~counter~0 6)} assume true; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,077 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13055#(<= ~counter~0 6)} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~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; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,079 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~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)); {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {13080#(<= ~counter~0 7)} ~cond := #in~cond; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {13080#(<= ~counter~0 7)} assume !(0 == ~cond); {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {13080#(<= ~counter~0 7)} assume true; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,080 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13080#(<= ~counter~0 7)} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,080 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~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; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,081 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~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)); {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,082 INFO L290 TraceCheckUtils]: 71: Hoare triple {13105#(<= ~counter~0 8)} ~cond := #in~cond; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {13105#(<= ~counter~0 8)} assume !(0 == ~cond); {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,082 INFO L290 TraceCheckUtils]: 73: Hoare triple {13105#(<= ~counter~0 8)} assume true; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,083 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13105#(<= ~counter~0 8)} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~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; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,084 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,084 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,084 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~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)); {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,085 INFO L290 TraceCheckUtils]: 79: Hoare triple {13130#(<= ~counter~0 9)} ~cond := #in~cond; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {13130#(<= ~counter~0 9)} assume !(0 == ~cond); {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,085 INFO L290 TraceCheckUtils]: 81: Hoare triple {13130#(<= ~counter~0 9)} assume true; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,085 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13130#(<= ~counter~0 9)} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,086 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~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; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,086 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-08 08:02:20,086 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L290 TraceCheckUtils]: 87: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {12889#false} assume !(0 == ~cond); {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {12889#false} assume true; {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12889#false} {12889#false} #57#return; {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-08 08:02:20,087 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-08 08:02:20,087 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 08:02:20,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:02:20,513 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-08 08:02:20,513 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-08 08:02:20,513 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-08 08:02:20,514 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-08 08:02:20,514 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12888#true} {12889#false} #57#return; {12889#false} is VALID [2022-04-08 08:02:20,514 INFO L290 TraceCheckUtils]: 89: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,514 INFO L290 TraceCheckUtils]: 88: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,514 INFO L290 TraceCheckUtils]: 87: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,514 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12888#true} is VALID [2022-04-08 08:02:20,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-08 08:02:20,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-08 08:02:20,515 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~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; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,515 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12888#true} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,515 INFO L290 TraceCheckUtils]: 79: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,516 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,517 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 08:02:20,517 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~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; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,517 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12888#true} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,517 INFO L290 TraceCheckUtils]: 71: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,518 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 08:02:20,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~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; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,519 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12888#true} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,519 INFO L290 TraceCheckUtils]: 64: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,519 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 08:02:20,520 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~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; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,521 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12888#true} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,521 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 08:02:20,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,523 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12888#true} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,523 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 08:02:20,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,524 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12888#true} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,525 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 08:02:20,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,526 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12888#true} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,526 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 08:02:20,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,528 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12888#true} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,528 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 08:02:20,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,530 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12888#true} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,530 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12888#true} is VALID [2022-04-08 08:02:20,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 08:02:20,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12888#true} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 08:02:20,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 08:02:20,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 08:02:20,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12888#true} is VALID [2022-04-08 08:02:20,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 08:02:20,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-08 08:02:20,537 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 08:02:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:02:20,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053334789] [2022-04-08 08:02:20,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:02:20,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401195837] [2022-04-08 08:02:20,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401195837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:02:20,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:02:20,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 08:02:20,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:02:20,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090912121] [2022-04-08 08:02:20,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090912121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:02:20,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:02:20,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 08:02:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186792340] [2022-04-08 08:02:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:02:20,539 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 08:02:20,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:02:20,539 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 08:02:20,633 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:02:20,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 08:02:20,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 08:02:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 08:02:20,634 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 08:02:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:21,100 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-08 08:02:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 08:02:21,100 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 08:02:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:02:21,100 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 08:02:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 08:02:21,103 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 08:02:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 08:02:21,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-08 08:02:21,209 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:02:21,210 INFO L225 Difference]: With dead ends: 110 [2022-04-08 08:02:21,211 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 08:02:21,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-08 08:02:21,212 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:02:21,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 126 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:02:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 08:02:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 08:02:21,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:02:21,367 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 08:02:21,367 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 08:02:21,367 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 08:02:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:21,369 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 08:02:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 08:02:21,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:21,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:21,370 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 08:02:21,370 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 08:02:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:02:21,372 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 08:02:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 08:02:21,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:02:21,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:02:21,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:02:21,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:02:21,373 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 08:02:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-08 08:02:21,375 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-08 08:02:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:02:21,375 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-08 08:02:21,375 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 08:02:21,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-08 08:02:25,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 101 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:02:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 08:02:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 08:02:25,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:02:25,953 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 08:02:25,973 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 08:02:26,163 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 08:02:26,164 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:02:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:02:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-08 08:02:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:02:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780297640] [2022-04-08 08:02:26,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:02:26,255 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:02:26,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:02:26,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-08 08:02:26,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:02:26,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085100679] [2022-04-08 08:02:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:02:26,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:02:26,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:02:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137009419] [2022-04-08 08:02:26,269 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:02:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:02:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:02:26,270 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 08:02:26,273 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:04:49,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 08:04:49,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:04:49,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 08:04:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:04:49,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:04:50,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {14108#true} call ULTIMATE.init(); {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {14108#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; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14108#true} {14108#true} #61#return; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {14108#true} call #t~ret6 := main(); {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {14108#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; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {14108#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14108#true} {14108#true} #53#return; {14108#true} is VALID [2022-04-08 08:04:50,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {14108#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:04:50,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:04:50,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:04:50,595 INFO L272 TraceCheckUtils]: 14: Hoare triple {14146#(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)); {14108#true} is VALID [2022-04-08 08:04:50,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,596 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14108#true} {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 08:04:50,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(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; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:04:50,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:04:50,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:04:50,597 INFO L272 TraceCheckUtils]: 22: Hoare triple {14171#(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)); {14108#true} is VALID [2022-04-08 08:04:50,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,598 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14108#true} {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 08:04:50,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {14171#(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; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:04:50,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:04:50,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:04:50,599 INFO L272 TraceCheckUtils]: 30: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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)); {14108#true} is VALID [2022-04-08 08:04:50,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,600 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14108#true} {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 08:04:50,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 08:04:50,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 08:04:50,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 08:04:50,601 INFO L272 TraceCheckUtils]: 38: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~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)); {14108#true} is VALID [2022-04-08 08:04:50,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,602 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14108#true} {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 08:04:50,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~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; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:04:50,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:04:50,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:04:50,604 INFO L272 TraceCheckUtils]: 46: Hoare triple {14246#(and (< 1 main_~k~0) (= 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)); {14108#true} is VALID [2022-04-08 08:04:50,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,604 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14108#true} {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 08:04:50,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {14246#(and (< 1 main_~k~0) (= 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; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:04:50,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:04:50,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:04:50,606 INFO L272 TraceCheckUtils]: 54: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 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)); {14108#true} is VALID [2022-04-08 08:04:50,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,606 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14108#true} {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 08:04:50,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 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; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:04:50,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:04:50,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:04:50,607 INFO L272 TraceCheckUtils]: 62: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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)); {14108#true} is VALID [2022-04-08 08:04:50,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,608 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14108#true} {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 08:04:50,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 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; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:04:50,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:04:50,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:04:50,617 INFO L272 TraceCheckUtils]: 70: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ 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)); {14108#true} is VALID [2022-04-08 08:04:50,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,617 INFO L290 TraceCheckUtils]: 73: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,617 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14108#true} {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 08:04:50,618 INFO L290 TraceCheckUtils]: 75: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ 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; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:04:50,618 INFO L290 TraceCheckUtils]: 76: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:04:50,619 INFO L290 TraceCheckUtils]: 77: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:04:50,619 INFO L272 TraceCheckUtils]: 78: Hoare triple {14346#(and (< 1 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)); {14108#true} is VALID [2022-04-08 08:04:50,619 INFO L290 TraceCheckUtils]: 79: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,619 INFO L290 TraceCheckUtils]: 80: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,619 INFO L290 TraceCheckUtils]: 81: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,619 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14108#true} {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 08:04:50,620 INFO L290 TraceCheckUtils]: 83: Hoare triple {14346#(and (< 1 main_~k~0) (= 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; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:04:50,622 INFO L290 TraceCheckUtils]: 84: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:04:50,622 INFO L290 TraceCheckUtils]: 85: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 10);havoc #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:04:50,622 INFO L272 TraceCheckUtils]: 86: Hoare triple {14371#(and (= main_~y~0 9) (< 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)); {14108#true} is VALID [2022-04-08 08:04:50,622 INFO L290 TraceCheckUtils]: 87: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,622 INFO L290 TraceCheckUtils]: 88: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,622 INFO L290 TraceCheckUtils]: 89: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,623 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14108#true} {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 08:04:50,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 08:04:50,624 INFO L272 TraceCheckUtils]: 92: Hoare triple {14396#(and (= main_~y~0 9) (<= 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)); {14108#true} is VALID [2022-04-08 08:04:50,624 INFO L290 TraceCheckUtils]: 93: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 08:04:50,624 INFO L290 TraceCheckUtils]: 94: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 08:04:50,624 INFO L290 TraceCheckUtils]: 95: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 08:04:50,624 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14108#true} {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 08:04:50,625 INFO L272 TraceCheckUtils]: 97: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:04:50,625 INFO L290 TraceCheckUtils]: 98: Hoare triple {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:04:50,626 INFO L290 TraceCheckUtils]: 99: Hoare triple {14419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14109#false} is VALID [2022-04-08 08:04:50,626 INFO L290 TraceCheckUtils]: 100: Hoare triple {14109#false} assume !false; {14109#false} is VALID [2022-04-08 08:04:50,626 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:04:50,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:04:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:04:51,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085100679] [2022-04-08 08:04:51,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:04:51,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137009419] [2022-04-08 08:04:51,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137009419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:04:51,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:04:51,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 08:04:51,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:04:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780297640] [2022-04-08 08:04:51,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780297640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:04:51,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:04:51,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 08:04:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854382810] [2022-04-08 08:04:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:04:51,556 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:04:51,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:04:51,556 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:04:51,614 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:04:51,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 08:04:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:04:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 08:04:51,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-08 08:04:51,615 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:04:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:04:53,179 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-08 08:04:53,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 08:04:53,179 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:04:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:04:53,179 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:04:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 08:04:53,181 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:04:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 08:04:53,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-08 08:04:53,258 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:04:53,260 INFO L225 Difference]: With dead ends: 108 [2022-04-08 08:04:53,260 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 08:04:53,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-08 08:04:53,261 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:04:53,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 08:04:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 08:04:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-08 08:04:53,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:04:53,414 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:04:53,414 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:04:53,414 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:04:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:04:53,416 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 08:04:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 08:04:53,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:04:53,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:04:53,417 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:04:53,417 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:04:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:04:53,419 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 08:04:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 08:04:53,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:04:53,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:04:53,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:04:53,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:04:53,420 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:04:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-08 08:04:53,422 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-08 08:04:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:04:53,422 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-08 08:04:53,422 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:04:53,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-08 08:04:58,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 08:04:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 08:04:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 08:04:58,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:04:58,029 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:04:58,069 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:04:58,230 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:04:58,230 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:04:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:04:58,230 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-08 08:04:58,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:04:58,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425773241] [2022-04-08 08:04:58,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:04:58,317 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 08:04:58,317 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:04:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-08 08:04:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:04:58,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566076019] [2022-04-08 08:04:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:04:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:04:58,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:04:58,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100320372] [2022-04-08 08:04:58,330 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 08:04:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:04:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:04:58,332 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:04:58,335 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:04:58,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 08:04:58,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 08:04:58,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.