/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/ps5-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:49:15,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:49:15,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:49:15,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:49:15,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:49:15,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:49:15,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:49:15,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:49:15,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:49:15,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:49:15,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:49:15,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:49:15,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:49:15,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:49:15,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:49:15,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:49:15,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:49:15,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:49:15,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:49:15,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:49:15,543 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:49:15,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:49:15,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:49:15,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:49:15,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:49:15,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:49:15,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:49:15,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:49:15,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:49:15,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:49:15,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:49:15,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:49:15,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:49:15,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:49:15,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:49:15,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:49:15,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:49:15,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:49:15,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:49:15,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:49:15,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:49:15,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:49:15,558 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:49:15,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:49:15,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:49:15,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:49:15,566 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:49:15,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:49:15,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:49:15,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:49:15,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:49:15,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:49:15,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:49:15,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:49:15,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:49:15,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:49:15,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:49:15,568 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:49:15,568 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:49:15,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:49:15,568 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:49:15,568 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:49:15,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:49:15,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:49:15,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:49:15,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:49:15,767 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:49:15,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c [2022-04-08 07:49:15,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4876cea51/890be141a17449788af48d5697a38c0d/FLAG8630e0feb [2022-04-08 07:49:16,164 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:49:16,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c [2022-04-08 07:49:16,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4876cea51/890be141a17449788af48d5697a38c0d/FLAG8630e0feb [2022-04-08 07:49:16,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4876cea51/890be141a17449788af48d5697a38c0d [2022-04-08 07:49:16,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:49:16,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:49:16,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:49:16,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:49:16,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:49:16,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f567ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16, skipping insertion in model container [2022-04-08 07:49:16,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:49:16,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:49:16,309 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/ps5-ll_valuebound100.c[458,471] [2022-04-08 07:49:16,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:49:16,328 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:49:16,335 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/ps5-ll_valuebound100.c[458,471] [2022-04-08 07:49:16,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:49:16,348 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:49:16,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16 WrapperNode [2022-04-08 07:49:16,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:49:16,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:49:16,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:49:16,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:49:16,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:49:16,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:49:16,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:49:16,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:49:16,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (1/1) ... [2022-04-08 07:49:16,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:49:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:16,410 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:49:16,414 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:49:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:49:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:49:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:49:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:49:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:49:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:49:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:49:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:49:16,470 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:49:16,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:49:16,572 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:49:16,577 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:49:16,577 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:49:16,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:49:16 BoogieIcfgContainer [2022-04-08 07:49:16,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:49:16,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:49:16,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:49:16,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:49:16,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:49:16" (1/3) ... [2022-04-08 07:49:16,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a449417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:49:16, skipping insertion in model container [2022-04-08 07:49:16,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:49:16" (2/3) ... [2022-04-08 07:49:16,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a449417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:49:16, skipping insertion in model container [2022-04-08 07:49:16,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:49:16" (3/3) ... [2022-04-08 07:49:16,618 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound100.c [2022-04-08 07:49:16,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:49:16,622 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:49:16,655 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:49:16,659 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:49:16,659 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:49:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:49:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 07:49:16,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:16,674 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:16,675 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-08 07:49:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:16,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133096780] [2022-04-08 07:49:16,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-08 07:49:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:16,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642279827] [2022-04-08 07:49:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:49:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:16,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#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); {32#true} is VALID [2022-04-08 07:49:16,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:49:16,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 07:49:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:49:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:16,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:49:16,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:49:16,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:49:16,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:49:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 07:49:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:16,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:49:16,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:49:16,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:49:16,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 07:49:16,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:49:16,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#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); {32#true} is VALID [2022-04-08 07:49:16,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 07:49:16,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 07:49:16,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 07:49:16,815 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:49:16,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {32#true} is VALID [2022-04-08 07:49:16,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:49:16,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:49:16,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:49:16,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 07:49:16,816 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 07:49:16,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 07:49:16,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 07:49:16,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 07:49:16,817 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 07:49:16,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 07:49:16,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-08 07:49:16,817 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 07:49:16,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 07:49:16,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 07:49:16,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 07:49:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:49:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642279827] [2022-04-08 07:49:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642279827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:16,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:16,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:49:16,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:16,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133096780] [2022-04-08 07:49:16,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133096780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:16,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:16,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:49:16,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578514002] [2022-04-08 07:49:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:16,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 07:49:16,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:16,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:49:16,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:16,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:49:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:49:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:49:16,862 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:49:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:16,949 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 07:49:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:49:16,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 07:49:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:49:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 07:49:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:49:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 07:49:16,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 07:49:17,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:17,031 INFO L225 Difference]: With dead ends: 51 [2022-04-08 07:49:17,031 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 07:49:17,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:49:17,035 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:17,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:49:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 07:49:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 07:49:17,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:17,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:49:17,070 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:49:17,070 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:49:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:17,076 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 07:49:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:49:17,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:17,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:17,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 07:49:17,077 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 07:49:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:17,079 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 07:49:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:49:17,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:17,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:17,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:17,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:49:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 07:49:17,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 07:49:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:17,086 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 07:49:17,086 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 07:49:17,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 07:49:17,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 07:49:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 07:49:17,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:17,111 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:17,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:49:17,112 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-08 07:49:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:17,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [342910462] [2022-04-08 07:49:17,113 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-08 07:49:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:17,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756520293] [2022-04-08 07:49:17,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:17,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:17,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:17,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545697667] [2022-04-08 07:49:17,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:49:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:17,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:17,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 07:49:17,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:49:17,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:17,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:49:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:17,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:17,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 07:49:17,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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); {246#true} is VALID [2022-04-08 07:49:17,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 07:49:17,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-08 07:49:17,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-08 07:49:17,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#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; {246#true} is VALID [2022-04-08 07:49:17,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {246#true} is VALID [2022-04-08 07:49:17,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 07:49:17,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 07:49:17,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 07:49:17,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-08 07:49:17,349 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-08 07:49:17,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 07:49:17,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 07:49:17,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 07:49:17,352 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-08 07:49:17,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:17,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:17,357 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:17,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:17,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 07:49:17,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 07:49:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:49:17,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:49:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756520293] [2022-04-08 07:49:17,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545697667] [2022-04-08 07:49:17,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545697667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:17,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:17,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:49:17,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:17,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [342910462] [2022-04-08 07:49:17,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [342910462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:17,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:17,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:49:17,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859911990] [2022-04-08 07:49:17,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:17,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 07:49:17,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:17,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:49:17,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:17,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:49:17,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:49:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:49:17,381 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:49:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:17,504 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 07:49:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:49:17,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 07:49:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:49:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 07:49:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:49:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 07:49:17,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 07:49:17,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:17,560 INFO L225 Difference]: With dead ends: 35 [2022-04-08 07:49:17,560 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:49:17,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:49:17,562 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:17,566 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:49:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:49:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:49:17,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:17,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:17,580 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:17,581 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:17,584 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 07:49:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 07:49:17,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:17,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:17,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-08 07:49:17,588 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-08 07:49:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:17,591 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 07:49:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 07:49:17,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:17,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:17,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:17,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 07:49:17,599 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 07:49:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:17,600 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 07:49:17,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 07:49:17,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-08 07:49:17,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 07:49:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 07:49:17,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:17,634 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:17,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:17,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:17,847 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-08 07:49:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:17,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [27822448] [2022-04-08 07:49:17,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-08 07:49:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:17,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921143141] [2022-04-08 07:49:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:17,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:17,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996726124] [2022-04-08 07:49:17,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:49:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:17,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:17,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 07:49:17,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:49:17,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:17,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:49:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:17,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:18,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 07:49:18,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-08 07:49:18,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:18,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 07:49:18,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 07:49:18,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-08 07:49:18,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {512#true} is VALID [2022-04-08 07:49:18,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:49:18,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:49:18,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:18,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 07:49:18,081 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 07:49:18,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:49:18,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:49:18,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:18,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 07:49:18,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:18,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:18,082 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 07:49:18,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:49:18,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:49:18,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:18,084 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:18,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(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 + ~x~0; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:49:18,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 07:49:18,085 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:18,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:18,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 07:49:18,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 07:49:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:49:18,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:18,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 07:49:18,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 07:49:18,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:18,252 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:18,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:49:20,257 WARN L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~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 + ~x~0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-08 07:49:20,267 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:49:20,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:20,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:49:20,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:49:20,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 07:49:20,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:49:20,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 07:49:20,276 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 07:49:20,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:20,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:49:20,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:49:20,277 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 07:49:20,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 07:49:20,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:20,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 07:49:20,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 07:49:20,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {512#true} is VALID [2022-04-08 07:49:20,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-08 07:49:20,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 07:49:20,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 07:49:20,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 07:49:20,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-08 07:49:20,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 07:49:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:49:20,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921143141] [2022-04-08 07:49:20,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996726124] [2022-04-08 07:49:20,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996726124] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:20,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:20,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:49:20,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:20,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [27822448] [2022-04-08 07:49:20,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [27822448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:20,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:20,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:49:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316966224] [2022-04-08 07:49:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 07:49:20,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:20,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:49:22,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:22,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:49:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:49:22,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:49:22,354 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:49:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:22,491 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 07:49:22,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:49:22,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 07:49:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:49:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:49:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:49:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 07:49:22,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 07:49:22,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:22,788 INFO L225 Difference]: With dead ends: 37 [2022-04-08 07:49:22,788 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 07:49:22,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:49:22,791 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:22,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:49:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 07:49:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 07:49:22,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:22,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:22,817 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:22,817 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:22,818 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 07:49:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 07:49:22,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:22,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:22,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-08 07:49:22,819 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-08 07:49:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:22,820 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 07:49:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 07:49:22,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:22,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:22,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:22,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:49:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 07:49:22,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 07:49:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:22,822 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 07:49:22,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:49:22,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 07:49:23,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 07:49:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 07:49:23,136 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:23,136 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:23,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 07:49:23,336 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 07:49:23,337 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-08 07:49:23,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:23,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962674947] [2022-04-08 07:49:23,338 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-08 07:49:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:23,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350664460] [2022-04-08 07:49:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:23,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:23,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490365568] [2022-04-08 07:49:23,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:49:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:23,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:23,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:23,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 07:49:23,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:49:23,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:23,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:49:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:23,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:23,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 07:49:23,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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); {900#true} is VALID [2022-04-08 07:49:23,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:49:23,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-08 07:49:23,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-08 07:49:23,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#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; {900#true} is VALID [2022-04-08 07:49:23,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {900#true} is VALID [2022-04-08 07:49:23,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:49:23,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:49:23,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:49:23,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-08 07:49:23,642 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-08 07:49:23,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:49:23,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:49:23,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:49:23,642 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-08 07:49:23,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:23,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:23,648 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 07:49:23,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:49:23,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:49:23,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:49:23,649 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:23,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(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 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:49:23,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:49:23,650 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 07:49:23,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:49:23,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:49:23,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:49:23,651 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:49:23,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:49:23,652 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 07:49:23,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 07:49:23,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 07:49:23,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 07:49:23,652 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:49:23,653 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(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)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:23,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:23,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-08 07:49:23,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 07:49:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 07:49:23,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350664460] [2022-04-08 07:49:23,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490365568] [2022-04-08 07:49:23,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490365568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:23,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:23,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:49:23,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962674947] [2022-04-08 07:49:23,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962674947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:23,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:23,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:49:23,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838095108] [2022-04-08 07:49:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:23,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 07:49:23,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:23,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:49:23,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:23,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:49:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:49:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:49:23,949 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:49:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:24,177 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 07:49:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:49:24,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 07:49:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:49:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 07:49:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:49:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 07:49:24,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 07:49:24,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:24,211 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:49:24,211 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 07:49:24,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:49:24,212 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:24,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:49:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 07:49:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 07:49:24,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:24,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:49:24,226 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:49:24,226 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:49:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:24,228 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 07:49:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 07:49:24,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:24,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:24,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 07:49:24,228 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 07:49:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:24,230 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 07:49:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 07:49:24,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:24,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:24,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:24,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:49:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 07:49:24,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 07:49:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:24,232 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 07:49:24,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 07:49:24,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-08 07:49:26,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 07:49:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 07:49:26,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:26,297 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 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] [2022-04-08 07:49:26,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:26,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:26,503 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:26,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-08 07:49:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:26,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537847222] [2022-04-08 07:49:26,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-08 07:49:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:26,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337036154] [2022-04-08 07:49:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:26,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:26,515 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799942762] [2022-04-08 07:49:26,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:49:26,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:26,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:26,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:26,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 07:49:26,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:49:26,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:26,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 07:49:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:26,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:26,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-08 07:49:26,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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); {1315#true} is VALID [2022-04-08 07:49:26,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#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; {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:49:26,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:49:26,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:49:26,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-08 07:49:26,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:26,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:26,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:49:26,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:49:26,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:49:26,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,814 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:26,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(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 + ~x~0; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:26,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:26,815 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:49:26,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:49:26,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:49:26,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,818 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:26,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(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 + ~x~0; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 07:49:26,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 07:49:26,819 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:49:26,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:49:26,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:49:26,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,827 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 07:49:26,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-08 07:49:26,828 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 07:49:26,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 07:49:26,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 07:49:26,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 07:49:26,829 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-08 07:49:26,829 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:26,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:26,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-08 07:49:26,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-08 07:49:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 07:49:26,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:27,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337036154] [2022-04-08 07:49:27,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:27,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799942762] [2022-04-08 07:49:27,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799942762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:27,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:27,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:49:27,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:27,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537847222] [2022-04-08 07:49:27,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537847222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:27,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:27,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:49:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88231914] [2022-04-08 07:49:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:27,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 07:49:27,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:27,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:49:27,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:27,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:49:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:49:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 07:49:27,118 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:49:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:27,390 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 07:49:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:49:27,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 07:49:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:49:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 07:49:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:49:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 07:49:27,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 07:49:27,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:27,428 INFO L225 Difference]: With dead ends: 45 [2022-04-08 07:49:27,428 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 07:49:27,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:49:27,429 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:27,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:49:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 07:49:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 07:49:27,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:27,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:49:27,448 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:49:27,448 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:49:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:27,450 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 07:49:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 07:49:27,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:27,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:27,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 07:49:27,451 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 07:49:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:27,454 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 07:49:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 07:49:27,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:27,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:27,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:27,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:49:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 07:49:27,456 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 07:49:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:27,456 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 07:49:27,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 07:49:27,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-08 07:49:27,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 07:49:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 07:49:27,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:27,952 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:27,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:28,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:28,153 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-08 07:49:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:28,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953487777] [2022-04-08 07:49:28,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-08 07:49:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:28,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190866771] [2022-04-08 07:49:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:28,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:28,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819228576] [2022-04-08 07:49:28,165 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:49:28,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:28,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:28,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:28,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 07:49:28,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:49:28,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:28,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:49:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:28,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:29,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#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); {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#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; {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID [2022-04-08 07:49:29,088 INFO L272 TraceCheckUtils]: 11: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,088 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID [2022-04-08 07:49:29,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:29,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:29,089 INFO L272 TraceCheckUtils]: 18: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,090 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1823#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:29,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(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 + ~x~0; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:29,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:29,091 INFO L272 TraceCheckUtils]: 25: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,092 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:29,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {1845#(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 + ~x~0; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:29,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:29,092 INFO L272 TraceCheckUtils]: 32: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,093 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:29,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:49:29,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:49:29,094 INFO L272 TraceCheckUtils]: 39: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,099 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:49:29,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:49:29,100 INFO L272 TraceCheckUtils]: 45: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 07:49:29,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 07:49:29,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 07:49:29,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 07:49:29,101 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 07:49:29,101 INFO L272 TraceCheckUtils]: 50: Hoare triple {1911#(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)); {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:29,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:29,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID [2022-04-08 07:49:29,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-08 07:49:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 07:49:29,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190866771] [2022-04-08 07:49:29,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819228576] [2022-04-08 07:49:29,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819228576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:29,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:29,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:49:29,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953487777] [2022-04-08 07:49:29,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953487777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:29,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:29,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:49:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865630749] [2022-04-08 07:49:29,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 07:49:29,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:29,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:49:29,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:29,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:49:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:49:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:49:29,393 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:49:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:29,765 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 07:49:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:49:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 07:49:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:49:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 07:49:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:49:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 07:49:29,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 07:49:29,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:29,806 INFO L225 Difference]: With dead ends: 48 [2022-04-08 07:49:29,806 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 07:49:29,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:49:29,806 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:29,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:49:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 07:49:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 07:49:29,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:29,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:49:29,824 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:49:29,824 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:49:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:29,825 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 07:49:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:49:29,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:29,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:29,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 07:49:29,826 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 07:49:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:29,827 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 07:49:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:49:29,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:29,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:29,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:29,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:49:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 07:49:29,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-08 07:49:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:29,829 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 07:49:29,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 07:49:29,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 07:49:30,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:49:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 07:49:30,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:30,270 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:30,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:30,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:30,472 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:30,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-08 07:49:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:30,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516413144] [2022-04-08 07:49:30,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-08 07:49:30,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:30,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299277945] [2022-04-08 07:49:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:30,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:30,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581607865] [2022-04-08 07:49:30,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:49:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:30,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:30,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 07:49:31,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:49:31,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:31,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:49:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:31,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:31,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID [2022-04-08 07:49:31,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2265#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); {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#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; {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,608 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID [2022-04-08 07:49:31,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:31,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:31,609 INFO L272 TraceCheckUtils]: 18: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,610 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2265#true} {2318#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:31,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#(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 + ~x~0; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:31,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:31,611 INFO L272 TraceCheckUtils]: 25: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,611 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2265#true} {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:49:31,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {2340#(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 + ~x~0; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:31,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:31,612 INFO L272 TraceCheckUtils]: 32: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,613 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2265#true} {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:49:31,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:49:31,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:49:31,614 INFO L272 TraceCheckUtils]: 39: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,615 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2265#true} {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:49:31,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 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 + ~x~0; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:49:31,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:49:31,616 INFO L272 TraceCheckUtils]: 46: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,616 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2265#true} {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 07:49:31,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:49:31,617 INFO L272 TraceCheckUtils]: 52: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 07:49:31,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 07:49:31,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 07:49:31,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 07:49:31,618 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2265#true} {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 07:49:31,618 INFO L272 TraceCheckUtils]: 57: Hoare triple {2428#(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)); {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:31,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:31,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID [2022-04-08 07:49:31,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID [2022-04-08 07:49:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 07:49:31,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:31,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:31,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299277945] [2022-04-08 07:49:31,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:31,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581607865] [2022-04-08 07:49:31,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581607865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:31,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:31,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:49:31,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:31,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516413144] [2022-04-08 07:49:31,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516413144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:31,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:31,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:49:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239333663] [2022-04-08 07:49:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:31,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 07:49:31,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:31,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:49:31,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:31,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:49:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:49:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:49:31,907 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:49:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:32,351 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 07:49:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:49:32,351 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 07:49:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:49:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 07:49:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:49:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 07:49:32,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-08 07:49:32,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:32,390 INFO L225 Difference]: With dead ends: 51 [2022-04-08 07:49:32,390 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 07:49:32,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:49:32,390 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:32,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:49:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 07:49:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 07:49:32,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:32,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:49:32,417 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:49:32,417 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:49:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:32,418 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 07:49:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 07:49:32,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:32,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:32,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 07:49:32,419 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 07:49:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:32,420 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 07:49:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 07:49:32,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:32,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:32,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:32,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:49:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-08 07:49:32,422 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-08 07:49:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:32,422 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-08 07:49:32,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 07:49:32,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-08 07:49:33,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 07:49:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 07:49:33,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:33,024 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:33,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:33,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:33,225 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:33,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:33,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-08 07:49:33,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:33,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012182680] [2022-04-08 07:49:33,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:33,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-08 07:49:33,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:33,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603481] [2022-04-08 07:49:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:33,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:33,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333331056] [2022-04-08 07:49:33,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:49:33,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:33,251 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:33,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 07:49:33,291 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:49:33,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:33,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:49:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:33,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:33,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID [2022-04-08 07:49:33,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#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); {2800#true} is VALID [2022-04-08 07:49:33,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID [2022-04-08 07:49:33,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID [2022-04-08 07:49:33,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {2800#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; {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,675 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID [2022-04-08 07:49:33,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:33,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:33,676 INFO L272 TraceCheckUtils]: 18: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,677 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2800#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:33,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(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 + ~x~0; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:33,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:33,678 INFO L272 TraceCheckUtils]: 25: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,679 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2800#true} {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:49:33,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {2875#(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 + ~x~0; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:49:33,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:49:33,679 INFO L272 TraceCheckUtils]: 32: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,680 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2800#true} {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:49:33,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {2897#(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 + ~x~0; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:49:33,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:49:33,681 INFO L272 TraceCheckUtils]: 39: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,682 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2800#true} {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:49:33,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {2919#(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 + ~x~0; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:33,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:33,683 INFO L272 TraceCheckUtils]: 46: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,684 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2800#true} {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:49:33,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {2941#(and (= 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 + ~x~0; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:49:33,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:49:33,685 INFO L272 TraceCheckUtils]: 53: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,685 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2800#true} {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:49:33,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:49:33,686 INFO L272 TraceCheckUtils]: 59: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 07:49:33,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 07:49:33,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 07:49:33,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 07:49:33,687 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2800#true} {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 07:49:33,687 INFO L272 TraceCheckUtils]: 64: Hoare triple {2985#(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)); {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:33,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:33,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID [2022-04-08 07:49:33,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID [2022-04-08 07:49:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 07:49:33,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:33,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603481] [2022-04-08 07:49:33,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333331056] [2022-04-08 07:49:33,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333331056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:33,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:33,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:49:33,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:33,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012182680] [2022-04-08 07:49:33,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012182680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:33,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:33,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:49:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418360504] [2022-04-08 07:49:33,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:33,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 07:49:33,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:33,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:49:33,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:33,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:49:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:49:33,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:49:33,975 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:49:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:34,513 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 07:49:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:49:34,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 07:49:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:49:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 07:49:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:49:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 07:49:34,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 07:49:34,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:34,561 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:49:34,561 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 07:49:34,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:49:34,561 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:34,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:49:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 07:49:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 07:49:34,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:34,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:49:34,595 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:49:34,596 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:49:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:34,597 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 07:49:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 07:49:34,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:34,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:34,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 07:49:34,598 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 07:49:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:34,599 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 07:49:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 07:49:34,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:34,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:34,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:34,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:49:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 07:49:34,601 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-08 07:49:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:34,601 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 07:49:34,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 07:49:34,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-08 07:49:35,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 07:49:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 07:49:35,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:35,016 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:35,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 07:49:35,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:35,223 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-08 07:49:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:35,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195360906] [2022-04-08 07:49:35,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-08 07:49:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:35,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786751230] [2022-04-08 07:49:35,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:35,258 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:35,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890228073] [2022-04-08 07:49:35,258 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:49:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:35,262 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:35,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 07:49:46,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:49:46,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:46,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 07:49:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:46,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:46,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2022-04-08 07:49:46,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#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); {3375#true} is VALID [2022-04-08 07:49:46,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#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; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L272 TraceCheckUtils]: 11: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID [2022-04-08 07:49:46,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:46,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:46,900 INFO L272 TraceCheckUtils]: 18: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,901 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3375#true} {3428#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:46,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(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 + ~x~0; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:49:46,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:49:46,902 INFO L272 TraceCheckUtils]: 25: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,903 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3375#true} {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:49:46,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {3450#(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 + ~x~0; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:49:46,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:49:46,903 INFO L272 TraceCheckUtils]: 32: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,905 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3375#true} {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:49:46,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 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 + ~x~0; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 07:49:46,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 07:49:46,906 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,907 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 07:49:46,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= 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 + ~x~0; {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:46,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:46,908 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,909 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:46,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(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 + ~x~0; {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:46,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:46,910 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,910 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3375#true} {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:49:46,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#(and (< 1 main_~k~0) (= 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 + ~x~0; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:49:46,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:49:46,911 INFO L272 TraceCheckUtils]: 60: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,912 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:49:46,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:49:46,912 INFO L272 TraceCheckUtils]: 66: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 07:49:46,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 07:49:46,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 07:49:46,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 07:49:46,913 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3375#true} {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:49:46,913 INFO L272 TraceCheckUtils]: 71: Hoare triple {3582#(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)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:46,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:46,914 INFO L290 TraceCheckUtils]: 73: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID [2022-04-08 07:49:46,914 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2022-04-08 07:49:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 07:49:46,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786751230] [2022-04-08 07:49:47,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890228073] [2022-04-08 07:49:47,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890228073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:47,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:47,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:49:47,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:47,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195360906] [2022-04-08 07:49:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195360906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:47,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:47,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:49:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80003880] [2022-04-08 07:49:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 07:49:47,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:47,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:49:47,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:47,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:49:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:47,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:49:47,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:49:47,492 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:49:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:48,120 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 07:49:48,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:49:48,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 07:49:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:49:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:49:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 07:49:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:49:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 07:49:48,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-08 07:49:48,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:48,175 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:49:48,175 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 07:49:48,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:49:48,176 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:49:48,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:49:48,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 07:49:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 07:49:48,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:49:48,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:49:48,208 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:49:48,209 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:49:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:48,210 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 07:49:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 07:49:48,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:48,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:48,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 07:49:48,211 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 07:49:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:49:48,212 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 07:49:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 07:49:48,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:49:48,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:49:48,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:49:48,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:49:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 07:49:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-08 07:49:48,214 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-08 07:49:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:49:48,215 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-08 07:49:48,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 07:49:48,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-08 07:49:50,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 07:49:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 07:49:50,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:49:50,920 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:49:50,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 07:49:51,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 07:49:51,127 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:49:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:49:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-08 07:49:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:51,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938760884] [2022-04-08 07:49:51,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:49:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-08 07:49:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:49:51,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874430083] [2022-04-08 07:49:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:49:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:49:51,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:49:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17638957] [2022-04-08 07:49:51,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:49:51,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:49:51,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:49:51,141 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:49:51,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 07:49:58,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:49:58,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:49:58,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:49:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:49:58,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:49:59,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {4078#true} call ULTIMATE.init(); {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {4078#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); {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4078#true} {4078#true} #63#return; {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {4078#true} call #t~ret5 := main(); {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {4078#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; {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {4078#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4078#true} {4078#true} #53#return; {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {4078#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4078#true} {4078#true} #55#return; {4078#true} is VALID [2022-04-08 07:49:59,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {4078#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4131#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:59,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {4131#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4131#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:59,141 INFO L272 TraceCheckUtils]: 18: Hoare triple {4131#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,141 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4078#true} {4131#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4131#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:49:59,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {4131#(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 + ~x~0; {4153#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:59,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {4153#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4153#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:59,142 INFO L272 TraceCheckUtils]: 25: Hoare triple {4153#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,143 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4078#true} {4153#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {4153#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:49:59,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {4153#(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 + ~x~0; {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:49:59,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:49:59,144 INFO L272 TraceCheckUtils]: 32: Hoare triple {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,144 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4078#true} {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 07:49:59,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:49:59,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !false; {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:49:59,145 INFO L272 TraceCheckUtils]: 39: Hoare triple {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,146 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4078#true} {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #57#return; {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 07:49:59,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 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 + ~x~0; {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:59,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:59,147 INFO L272 TraceCheckUtils]: 46: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,147 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4078#true} {4219#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:49:59,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {4219#(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 + ~x~0; {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:49:59,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:49:59,148 INFO L272 TraceCheckUtils]: 53: Hoare triple {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,149 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4078#true} {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #57#return; {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:49:59,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {4241#(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 + ~x~0; {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:49:59,150 INFO L290 TraceCheckUtils]: 59: Hoare triple {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:49:59,150 INFO L272 TraceCheckUtils]: 60: Hoare triple {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,150 INFO L290 TraceCheckUtils]: 61: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,150 INFO L290 TraceCheckUtils]: 62: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,150 INFO L290 TraceCheckUtils]: 63: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,151 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4078#true} {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #57#return; {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:49:59,151 INFO L290 TraceCheckUtils]: 65: Hoare triple {4263#(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 + ~x~0; {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:49:59,151 INFO L290 TraceCheckUtils]: 66: Hoare triple {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:49:59,152 INFO L272 TraceCheckUtils]: 67: Hoare triple {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,152 INFO L290 TraceCheckUtils]: 68: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,152 INFO L290 TraceCheckUtils]: 69: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,152 INFO L290 TraceCheckUtils]: 70: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,152 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4078#true} {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:49:59,153 INFO L290 TraceCheckUtils]: 72: Hoare triple {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:49:59,153 INFO L272 TraceCheckUtils]: 73: Hoare triple {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-08 07:49:59,153 INFO L290 TraceCheckUtils]: 74: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-08 07:49:59,153 INFO L290 TraceCheckUtils]: 75: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-08 07:49:59,153 INFO L290 TraceCheckUtils]: 76: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-08 07:49:59,154 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4078#true} {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:49:59,154 INFO L272 TraceCheckUtils]: 78: Hoare triple {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:49:59,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {4326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:49:59,155 INFO L290 TraceCheckUtils]: 80: Hoare triple {4330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4079#false} is VALID [2022-04-08 07:49:59,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {4079#false} assume !false; {4079#false} is VALID [2022-04-08 07:49:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 07:49:59,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:49:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:49:59,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874430083] [2022-04-08 07:49:59,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:49:59,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17638957] [2022-04-08 07:49:59,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17638957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:49:59,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:49:59,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:49:59,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:49:59,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938760884] [2022-04-08 07:49:59,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938760884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:49:59,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:49:59,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:49:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292014836] [2022-04-08 07:49:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:49:59,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 07:49:59,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:49:59,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:49:59,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:49:59,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:49:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:49:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:49:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:49:59,453 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:50:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:00,214 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 07:50:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:50:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 07:50:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:50:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:50:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 07:50:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:50:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 07:50:00,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-08 07:50:00,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:00,270 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:50:00,270 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 07:50:00,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:50:00,271 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:50:00,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:50:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 07:50:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 07:50:00,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:50:00,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:50:00,309 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:50:00,309 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:50:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:00,311 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 07:50:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 07:50:00,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:00,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:00,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 07:50:00,311 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 07:50:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:00,312 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 07:50:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 07:50:00,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:00,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:00,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:50:00,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:50:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 07:50:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 07:50:00,314 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-08 07:50:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:50:00,314 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 07:50:00,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 07:50:00,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 07:50:00,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 07:50:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 07:50:00,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:50:00,733 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:50:00,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 07:50:00,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 07:50:00,933 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:50:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:50:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-08 07:50:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:00,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1579459499] [2022-04-08 07:50:00,934 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:50:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-08 07:50:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:50:00,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124281673] [2022-04-08 07:50:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:50:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:50:00,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:50:00,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157834221] [2022-04-08 07:50:00,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:50:00,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:50:00,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:50:00,953 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:50:00,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 07:50:00,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:50:00,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:50:00,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:50:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:50:01,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:50:01,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#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); {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #63#return; {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret5 := main(); {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#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; {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {4733#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4733#true} {4733#true} #53#return; {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L272 TraceCheckUtils]: 11: Hoare triple {4733#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4733#true} {4733#true} #55#return; {4733#true} is VALID [2022-04-08 07:50:01,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {4733#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4786#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:01,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {4786#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4786#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:01,433 INFO L272 TraceCheckUtils]: 18: Hoare triple {4786#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,434 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4733#true} {4786#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4786#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:01,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {4786#(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 + ~x~0; {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:01,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:01,435 INFO L272 TraceCheckUtils]: 25: Hoare triple {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,435 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4733#true} {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:01,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {4808#(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 + ~x~0; {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:50:01,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:50:01,436 INFO L272 TraceCheckUtils]: 32: Hoare triple {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,437 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4733#true} {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 07:50:01,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {4830#(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 + ~x~0; {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:50:01,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:50:01,438 INFO L272 TraceCheckUtils]: 39: Hoare triple {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,439 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4733#true} {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-08 07:50:01,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4874#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:50:01,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {4874#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4874#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:50:01,440 INFO L272 TraceCheckUtils]: 46: Hoare triple {4874#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,440 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4733#true} {4874#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4874#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:50:01,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {4874#(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 + ~x~0; {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:50:01,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:50:01,441 INFO L272 TraceCheckUtils]: 53: Hoare triple {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,441 INFO L290 TraceCheckUtils]: 56: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,442 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4733#true} {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:50:01,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {4896#(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 + ~x~0; {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:01,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:01,442 INFO L272 TraceCheckUtils]: 60: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,443 INFO L290 TraceCheckUtils]: 62: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,443 INFO L290 TraceCheckUtils]: 63: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,443 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4733#true} {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:01,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:01,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:01,444 INFO L272 TraceCheckUtils]: 67: Hoare triple {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,444 INFO L290 TraceCheckUtils]: 69: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,445 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4733#true} {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:50:01,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {4940#(and (= 7 main_~y~0) (= 5 (+ (- 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 + ~x~0; {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:50:01,445 INFO L290 TraceCheckUtils]: 73: Hoare triple {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !false; {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:50:01,445 INFO L272 TraceCheckUtils]: 74: Hoare triple {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,445 INFO L290 TraceCheckUtils]: 75: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,446 INFO L290 TraceCheckUtils]: 76: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,446 INFO L290 TraceCheckUtils]: 77: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,446 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4733#true} {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #57#return; {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:50:01,447 INFO L290 TraceCheckUtils]: 79: Hoare triple {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 07:50:01,447 INFO L272 TraceCheckUtils]: 80: Hoare triple {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-08 07:50:01,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-08 07:50:01,447 INFO L290 TraceCheckUtils]: 82: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-08 07:50:01,447 INFO L290 TraceCheckUtils]: 83: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-08 07:50:01,447 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4733#true} {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #59#return; {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 07:50:01,448 INFO L272 TraceCheckUtils]: 85: Hoare triple {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:50:01,448 INFO L290 TraceCheckUtils]: 86: Hoare triple {5003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:50:01,448 INFO L290 TraceCheckUtils]: 87: Hoare triple {5007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-08 07:50:01,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-08 07:50:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 07:50:01,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:50:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:50:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124281673] [2022-04-08 07:50:01,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:50:01,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157834221] [2022-04-08 07:50:01,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157834221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:50:01,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:50:01,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:50:01,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:50:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1579459499] [2022-04-08 07:50:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1579459499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:50:01,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:50:01,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:50:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106973345] [2022-04-08 07:50:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:50:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 07:50:01,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:50:01,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:50:01,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:01,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:50:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:01,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:50:01,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:50:01,781 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:50:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:02,616 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 07:50:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:50:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 07:50:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:50:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:50:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 07:50:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:50:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 07:50:02,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-08 07:50:02,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:02,673 INFO L225 Difference]: With dead ends: 63 [2022-04-08 07:50:02,673 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 07:50:02,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:50:02,677 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:50:02,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:50:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 07:50:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 07:50:02,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:50:02,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:50:02,712 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:50:02,712 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:50:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:02,713 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 07:50:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 07:50:02,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:02,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:02,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 07:50:02,714 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 07:50:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:02,716 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 07:50:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 07:50:02,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:02,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:02,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:50:02,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:50:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 07:50:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-08 07:50:02,717 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-08 07:50:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:50:02,718 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-08 07:50:02,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 07:50:02,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-08 07:50:03,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 07:50:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 07:50:03,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:50:03,046 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:50:03,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 07:50:03,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 07:50:03,247 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:50:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:50:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-08 07:50:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:03,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022309506] [2022-04-08 07:50:03,248 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:50:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-08 07:50:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:50:03,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035031557] [2022-04-08 07:50:03,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:50:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:50:03,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:50:03,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392960578] [2022-04-08 07:50:03,259 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:50:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:50:03,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:50:03,260 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:50:03,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 07:50:36,539 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 07:50:36,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:50:36,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 07:50:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:50:36,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:50:37,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5428#true} is VALID [2022-04-08 07:50:37,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#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); {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #63#return; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#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; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {5428#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5428#true} {5428#true} #53#return; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L272 TraceCheckUtils]: 11: Hoare triple {5428#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,005 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5428#true} {5428#true} #55#return; {5428#true} is VALID [2022-04-08 07:50:37,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {5428#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5481#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:37,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {5481#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5481#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:37,023 INFO L272 TraceCheckUtils]: 18: Hoare triple {5481#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,024 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5428#true} {5481#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5481#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:50:37,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {5481#(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 + ~x~0; {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:37,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:37,025 INFO L272 TraceCheckUtils]: 25: Hoare triple {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,026 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5428#true} {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:50:37,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {5503#(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 + ~x~0; {5525#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:50:37,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {5525#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5525#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:50:37,027 INFO L272 TraceCheckUtils]: 32: Hoare triple {5525#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,027 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5428#true} {5525#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5525#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:50:37,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {5525#(and (= main_~y~0 2) (= 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 + ~x~0; {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:50:37,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:50:37,028 INFO L272 TraceCheckUtils]: 39: Hoare triple {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,029 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5428#true} {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:50:37,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:50:37,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:50:37,030 INFO L272 TraceCheckUtils]: 46: Hoare triple {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,030 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5428#true} {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:50:37,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~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 + ~x~0; {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:50:37,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:50:37,031 INFO L272 TraceCheckUtils]: 53: Hoare triple {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,032 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5428#true} {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:50:37,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {5591#(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 + ~x~0; {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:37,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:37,033 INFO L272 TraceCheckUtils]: 60: Hoare triple {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,033 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5428#true} {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:50:37,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 07:50:37,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !false; {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 07:50:37,034 INFO L272 TraceCheckUtils]: 67: Hoare triple {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,034 INFO L290 TraceCheckUtils]: 68: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,034 INFO L290 TraceCheckUtils]: 69: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,034 INFO L290 TraceCheckUtils]: 70: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,035 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5428#true} {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} #57#return; {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 07:50:37,035 INFO L290 TraceCheckUtils]: 72: Hoare triple {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~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 + ~x~0; {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:50:37,035 INFO L290 TraceCheckUtils]: 73: Hoare triple {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !false; {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:50:37,036 INFO L272 TraceCheckUtils]: 74: Hoare triple {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,036 INFO L290 TraceCheckUtils]: 75: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,036 INFO L290 TraceCheckUtils]: 76: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,036 INFO L290 TraceCheckUtils]: 77: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,036 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5428#true} {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} #57#return; {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 07:50:37,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:50:37,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:50:37,037 INFO L272 TraceCheckUtils]: 81: Hoare triple {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,039 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5428#true} {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 07:50:37,040 INFO L290 TraceCheckUtils]: 86: Hoare triple {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 07:50:37,040 INFO L272 TraceCheckUtils]: 87: Hoare triple {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-08 07:50:37,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-08 07:50:37,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-08 07:50:37,040 INFO L290 TraceCheckUtils]: 90: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-08 07:50:37,041 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5428#true} {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 07:50:37,041 INFO L272 TraceCheckUtils]: 92: Hoare triple {5701#(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)); {5720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:50:37,042 INFO L290 TraceCheckUtils]: 93: Hoare triple {5720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:50:37,042 INFO L290 TraceCheckUtils]: 94: Hoare triple {5724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5429#false} is VALID [2022-04-08 07:50:37,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-08 07:50:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 07:50:37,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:50:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:50:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035031557] [2022-04-08 07:50:37,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:50:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392960578] [2022-04-08 07:50:37,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392960578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:50:37,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:50:37,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 07:50:37,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:50:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022309506] [2022-04-08 07:50:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022309506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:50:37,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:50:37,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 07:50:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712080637] [2022-04-08 07:50:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:50:37,281 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-08 07:50:37,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:50:37,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 07:50:37,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:37,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 07:50:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:37,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 07:50:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:50:37,325 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 07:50:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:38,297 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-08 07:50:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 07:50:38,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-08 07:50:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:50:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 07:50:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-08 07:50:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 07:50:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-08 07:50:38,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-08 07:50:38,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:38,357 INFO L225 Difference]: With dead ends: 66 [2022-04-08 07:50:38,357 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 07:50:38,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:50:38,358 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:50:38,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:50:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 07:50:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 07:50:38,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:50:38,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:50:38,394 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:50:38,395 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:50:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:38,396 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 07:50:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 07:50:38,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:38,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:38,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-08 07:50:38,396 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-08 07:50:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:50:38,397 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 07:50:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 07:50:38,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:50:38,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:50:38,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:50:38,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:50:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 07:50:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-08 07:50:38,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-08 07:50:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:50:38,399 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-08 07:50:38,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 07:50:38,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions. [2022-04-08 07:50:40,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 70 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:50:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 07:50:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 07:50:40,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:50:40,495 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:50:40,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 07:50:40,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 07:50:40,707 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:50:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:50:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times [2022-04-08 07:50:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:50:40,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365432750] [2022-04-08 07:50:40,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:50:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times [2022-04-08 07:50:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:50:40,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327016583] [2022-04-08 07:50:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:50:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:50:40,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:50:40,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217246082] [2022-04-08 07:50:40,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:50:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:50:40,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:50:40,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:50:40,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 07:52:57,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:52:57,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:52:57,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 07:52:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:52:57,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:52:57,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {6163#true} call ULTIMATE.init(); {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {6163#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); {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6163#true} {6163#true} #63#return; {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {6163#true} call #t~ret5 := main(); {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {6163#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; {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {6163#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6163#true} {6163#true} #53#return; {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {6163#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6163#true} {6163#true} #55#return; {6163#true} is VALID [2022-04-08 07:52:57,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {6163#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:52:57,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {6216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:52:57,925 INFO L272 TraceCheckUtils]: 18: Hoare triple {6216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6163#true} {6216#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:52:57,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {6216#(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 + ~x~0; {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:52:57,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:52:57,926 INFO L272 TraceCheckUtils]: 25: Hoare triple {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,927 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6163#true} {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 07:52:57,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< 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 + ~x~0; {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:57,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:57,928 INFO L272 TraceCheckUtils]: 32: Hoare triple {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,934 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6163#true} {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #57#return; {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:52:57,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:52:57,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:52:57,936 INFO L272 TraceCheckUtils]: 39: Hoare triple {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,936 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6163#true} {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #57#return; {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:52:57,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:52:57,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:52:57,938 INFO L272 TraceCheckUtils]: 46: Hoare triple {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,938 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6163#true} {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:52:57,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 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 + ~x~0; {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:52:57,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:52:57,939 INFO L272 TraceCheckUtils]: 53: Hoare triple {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,940 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6163#true} {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 07:52:57,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~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 + ~x~0; {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:52:57,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} assume !false; {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:52:57,941 INFO L272 TraceCheckUtils]: 60: Hoare triple {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,941 INFO L290 TraceCheckUtils]: 61: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,941 INFO L290 TraceCheckUtils]: 62: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,941 INFO L290 TraceCheckUtils]: 63: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,942 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6163#true} {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} #57#return; {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 07:52:57,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 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 + ~x~0; {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 07:52:57,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} assume !false; {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 07:52:57,943 INFO L272 TraceCheckUtils]: 67: Hoare triple {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,944 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6163#true} {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} #57#return; {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-08 07:52:57,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:52:57,945 INFO L290 TraceCheckUtils]: 73: Hoare triple {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:52:57,945 INFO L272 TraceCheckUtils]: 74: Hoare triple {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,945 INFO L290 TraceCheckUtils]: 77: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,946 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6163#true} {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} #57#return; {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:52:57,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 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 + ~x~0; {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:52:57,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:52:57,947 INFO L272 TraceCheckUtils]: 81: Hoare triple {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,947 INFO L290 TraceCheckUtils]: 84: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,947 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6163#true} {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #57#return; {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-08 07:52:57,948 INFO L290 TraceCheckUtils]: 86: Hoare triple {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 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 + ~x~0; {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:52:57,948 INFO L290 TraceCheckUtils]: 87: Hoare triple {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:52:57,948 INFO L272 TraceCheckUtils]: 88: Hoare triple {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,948 INFO L290 TraceCheckUtils]: 89: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,949 INFO L290 TraceCheckUtils]: 90: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,949 INFO L290 TraceCheckUtils]: 91: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,949 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6163#true} {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:52:57,950 INFO L290 TraceCheckUtils]: 93: Hoare triple {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:52:57,950 INFO L272 TraceCheckUtils]: 94: Hoare triple {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-08 07:52:57,950 INFO L290 TraceCheckUtils]: 95: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-08 07:52:57,950 INFO L290 TraceCheckUtils]: 96: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-08 07:52:57,950 INFO L290 TraceCheckUtils]: 97: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-08 07:52:57,950 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6163#true} {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #59#return; {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 07:52:57,951 INFO L272 TraceCheckUtils]: 99: Hoare triple {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6477#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:52:57,951 INFO L290 TraceCheckUtils]: 100: Hoare triple {6477#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6481#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:52:57,952 INFO L290 TraceCheckUtils]: 101: Hoare triple {6481#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6164#false} is VALID [2022-04-08 07:52:57,952 INFO L290 TraceCheckUtils]: 102: Hoare triple {6164#false} assume !false; {6164#false} is VALID [2022-04-08 07:52:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 07:52:57,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:52:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:52:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327016583] [2022-04-08 07:52:58,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:52:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217246082] [2022-04-08 07:52:58,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217246082] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:52:58,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:52:58,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 07:52:58,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:52:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365432750] [2022-04-08 07:52:58,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365432750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:52:58,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:52:58,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 07:52:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151456936] [2022-04-08 07:52:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:52:58,962 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-08 07:52:58,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:52:58,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 07:52:59,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:52:59,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 07:52:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:52:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 07:52:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-04-08 07:52:59,034 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 07:53:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:00,403 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-08 07:53:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:53:00,403 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-08 07:53:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:53:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 07:53:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-08 07:53:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 07:53:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-08 07:53:00,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-08 07:53:00,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:53:00,465 INFO L225 Difference]: With dead ends: 69 [2022-04-08 07:53:00,465 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 07:53:00,465 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-04-08 07:53:00,466 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:53:00,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 07:53:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 07:53:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 07:53:00,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:53:00,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:53:00,513 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:53:00,513 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:53:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:00,515 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 07:53:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 07:53:00,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:53:00,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:53:00,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-08 07:53:00,515 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-08 07:53:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:00,516 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 07:53:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 07:53:00,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:53:00,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:53:00,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:53:00,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:53:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 07:53:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-08 07:53:00,518 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-08 07:53:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:53:00,518 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-08 07:53:00,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 07:53:00,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-08 07:53:00,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:53:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 07:53:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 07:53:00,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:53:00,877 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:53:00,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 07:53:01,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 07:53:01,099 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:53:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:53:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times [2022-04-08 07:53:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:53:01,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196012347] [2022-04-08 07:53:01,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:53:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times [2022-04-08 07:53:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:53:01,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586613768] [2022-04-08 07:53:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:53:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:53:01,118 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:53:01,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546121066] [2022-04-08 07:53:01,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:53:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:53:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:53:01,121 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:53:01,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 07:53:01,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:53:01,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:53:01,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 07:53:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:53:01,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:53:01,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-08 07:53:01,677 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); {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7136#true} {7136#true} #63#return; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {7136#true} call #t~ret5 := main(); {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {7136#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; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {7136#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7136#true} #53#return; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {7136#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7136#true} {7136#true} #55#return; {7136#true} is VALID [2022-04-08 07:53:01,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:53:01,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {7189#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:53:01,678 INFO L272 TraceCheckUtils]: 18: Hoare triple {7189#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,679 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7136#true} {7189#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {7189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:53:01,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {7189#(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 + ~x~0; {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:53:01,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:53:01,689 INFO L272 TraceCheckUtils]: 25: Hoare triple {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,691 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7136#true} {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:53:01,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {7211#(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 + ~x~0; {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:53:01,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:53:01,692 INFO L272 TraceCheckUtils]: 32: Hoare triple {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,692 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7136#true} {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:53:01,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {7233#(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 + ~x~0; {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:53:01,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:53:01,693 INFO L272 TraceCheckUtils]: 39: Hoare triple {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,694 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7136#true} {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 07:53:01,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:53:01,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:53:01,694 INFO L272 TraceCheckUtils]: 46: Hoare triple {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,695 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #57#return; {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:53:01,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~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 + ~x~0; {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:53:01,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:53:01,696 INFO L272 TraceCheckUtils]: 53: Hoare triple {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,701 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {7136#true} {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 07:53:01,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:01,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:01,702 INFO L272 TraceCheckUtils]: 60: Hoare triple {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,702 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7136#true} {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:01,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:53:01,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:53:01,703 INFO L272 TraceCheckUtils]: 67: Hoare triple {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,703 INFO L290 TraceCheckUtils]: 70: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,704 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7136#true} {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #57#return; {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 07:53:01,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:53:01,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:53:01,704 INFO L272 TraceCheckUtils]: 74: Hoare triple {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,705 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7136#true} {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #57#return; {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-08 07:53:01,705 INFO L290 TraceCheckUtils]: 79: Hoare triple {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~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 + ~x~0; {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:01,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:01,706 INFO L272 TraceCheckUtils]: 81: Hoare triple {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,706 INFO L290 TraceCheckUtils]: 82: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,706 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {7136#true} {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #57#return; {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 07:53:01,707 INFO L290 TraceCheckUtils]: 86: Hoare triple {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 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 + ~x~0; {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-08 07:53:01,707 INFO L290 TraceCheckUtils]: 87: Hoare triple {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !false; {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-08 07:53:01,707 INFO L272 TraceCheckUtils]: 88: Hoare triple {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,707 INFO L290 TraceCheckUtils]: 90: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,708 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {7136#true} {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} #57#return; {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-08 07:53:01,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~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 + ~x~0; {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:53:01,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !false; {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:53:01,708 INFO L272 TraceCheckUtils]: 95: Hoare triple {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,709 INFO L290 TraceCheckUtils]: 96: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,709 INFO L290 TraceCheckUtils]: 98: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,709 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7136#true} {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #57#return; {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:53:01,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:53:01,710 INFO L272 TraceCheckUtils]: 101: Hoare triple {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-08 07:53:01,710 INFO L290 TraceCheckUtils]: 102: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 07:53:01,710 INFO L290 TraceCheckUtils]: 103: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 07:53:01,710 INFO L290 TraceCheckUtils]: 104: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 07:53:01,711 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7136#true} {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} #59#return; {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 07:53:01,711 INFO L272 TraceCheckUtils]: 106: Hoare triple {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7472#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:53:01,711 INFO L290 TraceCheckUtils]: 107: Hoare triple {7472#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7476#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:53:01,712 INFO L290 TraceCheckUtils]: 108: Hoare triple {7476#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7137#false} is VALID [2022-04-08 07:53:01,712 INFO L290 TraceCheckUtils]: 109: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-08 07:53:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 07:53:01,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:53:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:53:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586613768] [2022-04-08 07:53:01,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:53:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546121066] [2022-04-08 07:53:01,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546121066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:53:01,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:53:01,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 07:53:01,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:53:01,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196012347] [2022-04-08 07:53:01,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196012347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:53:01,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:53:01,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 07:53:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715387842] [2022-04-08 07:53:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:53:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-08 07:53:01,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:53:01,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 07:53:02,037 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 07:53:02,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 07:53:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:53:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 07:53:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:53:02,038 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 07:53:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:03,364 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-08 07:53:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 07:53:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-08 07:53:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:53:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 07:53:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-08 07:53:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 07:53:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-08 07:53:03,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-08 07:53:03,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:53:03,430 INFO L225 Difference]: With dead ends: 72 [2022-04-08 07:53:03,431 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 07:53:03,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:53:03,431 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:53:03,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 07:53:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 07:53:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-08 07:53:03,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:53:03,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:53:03,483 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:53:03,483 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:53:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:03,484 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 07:53:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 07:53:03,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:53:03,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:53:03,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 07:53:03,485 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 07:53:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:53:03,486 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 07:53:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 07:53:03,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:53:03,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:53:03,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:53:03,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:53:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 07:53:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-08 07:53:03,488 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-08 07:53:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:53:03,488 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-08 07:53:03,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 07:53:03,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-08 07:53:04,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:53:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 07:53:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 07:53:04,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:53:04,027 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:53:04,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 07:53:04,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 07:53:04,244 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:53:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:53:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times [2022-04-08 07:53:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:53:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658772901] [2022-04-08 07:53:04,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:53:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times [2022-04-08 07:53:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:53:04,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109454254] [2022-04-08 07:53:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:53:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:53:04,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:53:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195465376] [2022-04-08 07:53:04,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:53:04,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:53:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:53:04,256 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:53:04,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process