/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:59:45,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:59:45,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:59:45,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:59:45,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:59:45,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:59:45,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:59:45,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:59:45,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:59:45,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:59:45,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:59:45,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:59:45,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:59:45,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:59:45,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:59:45,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:59:45,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:59:45,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:59:45,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:59:45,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:59:45,437 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:59:45,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:59:45,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:59:45,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:59:45,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:59:45,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:59:45,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:59:45,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:59:45,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:59:45,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:59:45,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:59:45,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:59:45,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:59:45,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:59:45,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:59:45,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:59:45,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:59:45,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:59:45,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:59:45,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:59:45,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:59:45,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:59:45,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:59:45,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:59:45,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:59:45,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:59:45,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:59:45,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:59:45,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:59:45,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:59:45,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:59:45,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:59:45,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:59:45,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:59:45,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:59:45,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:59:45,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:59:45,463 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:59:45,463 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:59:45,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:59:45,463 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:59:45,463 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-15 10:59:45,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:59:45,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:59:45,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:59:45,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:59:45,669 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:59:45,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-15 10:59:45,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf02ad1b4/97d9ad544a0f46f1992db87d55dca826/FLAGd7368c1a9 [2022-04-15 10:59:46,060 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:59:46,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-15 10:59:46,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf02ad1b4/97d9ad544a0f46f1992db87d55dca826/FLAGd7368c1a9 [2022-04-15 10:59:46,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf02ad1b4/97d9ad544a0f46f1992db87d55dca826 [2022-04-15 10:59:46,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:59:46,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:59:46,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:59:46,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:59:46,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:59:46,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b171a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46, skipping insertion in model container [2022-04-15 10:59:46,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:59:46,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:59:46,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c[458,471] [2022-04-15 10:59:46,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:59:46,242 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:59:46,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c[458,471] [2022-04-15 10:59:46,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:59:46,281 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:59:46,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46 WrapperNode [2022-04-15 10:59:46,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:59:46,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:59:46,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:59:46,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:59:46,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:59:46,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:59:46,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:59:46,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:59:46,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (1/1) ... [2022-04-15 10:59:46,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:59:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:59:46,330 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-15 10:59:46,340 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-15 10:59:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:59:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:59:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:59:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:59:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:59:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:59:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:59:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:59:46,354 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:59:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:59:46,411 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:59:46,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:59:46,505 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:59:46,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:59:46,510 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:59:46,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:59:46 BoogieIcfgContainer [2022-04-15 10:59:46,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:59:46,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:59:46,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:59:46,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:59:46,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:59:46" (1/3) ... [2022-04-15 10:59:46,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60772b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:59:46, skipping insertion in model container [2022-04-15 10:59:46,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:59:46" (2/3) ... [2022-04-15 10:59:46,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60772b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:59:46, skipping insertion in model container [2022-04-15 10:59:46,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:59:46" (3/3) ... [2022-04-15 10:59:46,529 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2022-04-15 10:59:46,533 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:59:46,533 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:59:46,597 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:59:46,602 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-15 10:59:46,602 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:59:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:59:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 10:59:46,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:59:46,636 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:59:46,637 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:59:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:59:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-15 10:59:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:46,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573301006] [2022-04-15 10:59:46,665 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:59:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-15 10:59:46,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:59:46,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613779662] [2022-04-15 10:59:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:59:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:59:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:46,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:59:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:46,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-15 10:59:46,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 10:59:46,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-15 10:59:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:59:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:59:46,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:59:46,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:59:46,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:59:46,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 10:59:46,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:59:46,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32#true} is VALID [2022-04-15 10:59:46,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 10:59:46,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-15 10:59:46,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-15 10:59:46,849 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-15 10:59:46,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-15 10:59:46,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 10:59:46,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 10:59:46,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 10:59:46,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 10:59:46,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-15 10:59:46,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-15 10:59:46,852 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-15 10:59:46,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 10:59:46,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 10:59:46,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 10:59:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:59:46,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:59:46,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613779662] [2022-04-15 10:59:46,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613779662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:46,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:46,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:59:46,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:59:46,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573301006] [2022-04-15 10:59:46,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573301006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:59:46,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:59:46,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:59:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762427689] [2022-04-15 10:59:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:59:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:59:46,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:59:46,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:59:46,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:59:46,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:59:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:59:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:59:46,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:59:46,902 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:01,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24m for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 11:01:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:01,624 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-15 11:01:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 11:01:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 11:01:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 11:01:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-15 11:01:01,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-15 11:01:01,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:01,711 INFO L225 Difference]: With dead ends: 50 [2022-04-15 11:01:01,711 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 11:01:01,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 11:01:01,715 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:01,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 74.5s Time] [2022-04-15 11:01:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 11:01:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 11:01:01,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:01,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:01,743 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:01,743 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:01,754 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 11:01:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 11:01:01,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:01,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:01,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-15 11:01:01,756 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-15 11:01:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:01,758 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 11:01:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 11:01:01,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:01,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:01,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:01,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 11:01:01,762 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-15 11:01:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:01,762 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 11:01:01,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:01,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 11:01:01,791 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-15 11:01:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 11:01:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:01:01,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:01,792 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:01,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:01:01,792 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-15 11:01:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:01,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125009118] [2022-04-15 11:01:01,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:01:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-15 11:01:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:01,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226790474] [2022-04-15 11:01:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:01,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:01,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265786329] [2022-04-15 11:01:01,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:01:01,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:01,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:01,821 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-15 11:01:01,823 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-15 11:01:01,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 11:01:01,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 11:01:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:01,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:02,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-15 11:01:02,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:02,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-15 11:01:02,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {243#false} is VALID [2022-04-15 11:01:02,046 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {243#false} is VALID [2022-04-15 11:01:02,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-15 11:01:02,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-15 11:01:02,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-15 11:01:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:01:02,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:01:02,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:02,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226790474] [2022-04-15 11:01:02,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:02,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265786329] [2022-04-15 11:01:02,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265786329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:02,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:02,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:01:02,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:02,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125009118] [2022-04-15 11:01:02,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125009118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:02,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:02,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:01:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468422990] [2022-04-15 11:01:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:02,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 11:01:02,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:02,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:01:02,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:02,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:01:02,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:01:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:01:02,075 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:01:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:02,140 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 11:01:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:01:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 11:01:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:01:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 11:01:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:01:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 11:01:02,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 11:01:02,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:02,180 INFO L225 Difference]: With dead ends: 34 [2022-04-15 11:01:02,180 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 11:01:02,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:01:02,182 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:02,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 11:01:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 11:01:02,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:02,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:02,204 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:02,205 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:02,208 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 11:01:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 11:01:02,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:02,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:02,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 11:01:02,209 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 11:01:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:02,210 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 11:01:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 11:01:02,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:02,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:02,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:02,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 11:01:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 11:01:02,212 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-15 11:01:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:02,212 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 11:01:02,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:01:02,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 11:01:02,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 11:01:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:01:02,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:02,235 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:02,258 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-15 11:01:02,451 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-15 11:01:02,452 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-15 11:01:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:02,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366699535] [2022-04-15 11:01:02,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:01:02,453 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-15 11:01:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750661679] [2022-04-15 11:01:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:02,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:02,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902737929] [2022-04-15 11:01:02,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:01:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:02,473 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-15 11:01:02,474 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-15 11:01:02,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 11:01:02,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:02,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 11:01:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:02,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-15 11:01:02,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {471#true} is VALID [2022-04-15 11:01:02,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-15 11:01:02,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-15 11:01:02,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-15 11:01:02,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {471#true} is VALID [2022-04-15 11:01:02,624 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-15 11:01:02,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-15 11:01:02,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-15 11:01:02,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-15 11:01:02,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-15 11:01:02,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:02,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:02,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:02,628 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:01:02,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:01:02,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-15 11:01:02,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-15 11:01:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:01:02,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 11:01:02,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:02,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750661679] [2022-04-15 11:01:02,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:02,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902737929] [2022-04-15 11:01:02,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902737929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:02,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:02,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:01:02,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:02,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366699535] [2022-04-15 11:01:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366699535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:02,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:02,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:01:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142545102] [2022-04-15 11:01:02,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 11:01:02,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:02,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:02,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:02,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:01:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:01:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:01:02,644 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:02,803 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 11:01:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:01:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 11:01:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 11:01:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 11:01:02,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 11:01:02,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:02,842 INFO L225 Difference]: With dead ends: 36 [2022-04-15 11:01:02,842 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 11:01:02,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:01:02,845 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:02,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 11:01:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 11:01:02,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:02,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:02,862 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:02,863 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:02,864 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 11:01:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 11:01:02,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:02,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:02,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-15 11:01:02,865 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-15 11:01:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:02,871 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 11:01:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 11:01:02,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:02,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:02,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:02,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 11:01:02,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-15 11:01:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:02,877 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 11:01:02,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 11:01:02,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 11:01:02,905 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-15 11:01:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 11:01:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:01:02,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:02,907 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:02,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 11:01:03,115 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-15 11:01:03,116 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-15 11:01:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:03,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141219644] [2022-04-15 11:01:03,324 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:03,325 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:03,325 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-15 11:01:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:03,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486679300] [2022-04-15 11:01:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:03,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:03,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797806157] [2022-04-15 11:01:03,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:01:03,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:03,339 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-15 11:01:03,340 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-15 11:01:03,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:01:03,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:03,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 11:01:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:03,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:03,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-15 11:01:03,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:03,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,677 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,679 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {773#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:03,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-15 11:01:03,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-15 11:01:03,681 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-15 11:01:03,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-15 11:01:03,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-15 11:01:03,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-15 11:01:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:01:03,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:03,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-15 11:01:03,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-15 11:01:03,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-15 11:01:03,810 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {732#false} is VALID [2022-04-15 11:01:03,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-15 11:01:03,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:01:03,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {830#(< ~counter~0 10)} is VALID [2022-04-15 11:01:03,817 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 10)} #55#return; {830#(< ~counter~0 10)} is VALID [2022-04-15 11:01:03,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-15 11:01:03,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-15 11:01:03,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-15 11:01:03,817 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {731#true} is VALID [2022-04-15 11:01:03,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-15 11:01:03,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-15 11:01:03,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 9)} #53#return; {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-15 11:01:03,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-15 11:01:03,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-15 11:01:03,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-15 11:01:03,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 9)} call #t~ret6 := main(); {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 9)} {731#true} #61#return; {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 9)} assume true; {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-15 11:01:03,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-15 11:01:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:01:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486679300] [2022-04-15 11:01:03,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797806157] [2022-04-15 11:01:03,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797806157] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:01:03,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:01:03,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 11:01:03,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:03,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1141219644] [2022-04-15 11:01:03,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1141219644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:03,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:03,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:01:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770467459] [2022-04-15 11:01:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-15 11:01:03,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:03,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:01:03,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:03,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:01:03,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:03,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:01:03,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:01:03,843 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:01:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:03,941 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 11:01:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:01:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-15 11:01:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:01:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 11:01:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:01:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 11:01:03,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-15 11:01:03,975 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-15 11:01:03,978 INFO L225 Difference]: With dead ends: 42 [2022-04-15 11:01:03,978 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 11:01:03,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 11:01:03,979 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:03,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 11:01:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 11:01:03,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:03,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:03,998 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:03,999 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:04,001 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 11:01:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 11:01:04,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:04,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:04,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-15 11:01:04,005 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-15 11:01:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:04,008 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 11:01:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 11:01:04,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:04,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:04,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:04,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 11:01:04,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-15 11:01:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:04,011 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 11:01:04,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:01:04,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 11:01:04,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 11:01:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:01:04,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:04,038 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:04,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 11:01:04,243 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-15 11:01:04,244 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-15 11:01:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [959914969] [2022-04-15 11:01:04,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:04,426 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:04,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-15 11:01:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:04,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754840390] [2022-04-15 11:01:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:04,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:04,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532230332] [2022-04-15 11:01:04,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:01:04,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:04,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:04,446 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-15 11:01:04,457 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-15 11:01:04,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:01:04,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:04,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 11:01:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:04,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:04,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 11:01:04,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:01:04,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-15 11:01:04,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:04,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:04,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:04,610 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-15 11:01:04,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:01:04,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:01:04,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:01:04,611 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:04,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-15 11:01:04,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-15 11:01:04,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-15 11:01:04,613 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:01:04,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:01:04,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 11:01:04,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 11:01:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:01:04,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:04,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 11:01:04,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 11:01:04,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:01:04,740 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:01:04,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 11:01:04,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 11:01:08,957 WARN L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is UNKNOWN [2022-04-15 11:01:08,961 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #55#return; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 11:01:08,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:01:08,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:01:08,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:01:08,961 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1116#true} is VALID [2022-04-15 11:01:08,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 11:01:08,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 11:01:08,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-15 11:01:08,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 11:01:08,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-15 11:01:08,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 11:01:08,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1116#true} is VALID [2022-04-15 11:01:08,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 11:01:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:01:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:08,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754840390] [2022-04-15 11:01:08,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:08,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532230332] [2022-04-15 11:01:08,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532230332] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:01:08,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:01:08,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 11:01:08,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [959914969] [2022-04-15 11:01:08,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [959914969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:08,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:08,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:01:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244758992] [2022-04-15 11:01:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 11:01:08,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:08,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:01:13,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:13,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:01:13,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:13,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:01:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:01:13,230 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:01:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:13,342 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-15 11:01:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:01:13,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 11:01:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:01:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 11:01:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:01:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 11:01:13,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 11:01:17,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:17,612 INFO L225 Difference]: With dead ends: 40 [2022-04-15 11:01:17,613 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 11:01:17,613 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:01:17,613 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:17,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 11:01:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 11:01:17,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:17,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:17,635 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:17,635 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:17,636 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 11:01:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 11:01:17,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:17,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:17,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-15 11:01:17,637 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-15 11:01:17,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:17,638 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 11:01:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 11:01:17,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:17,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:17,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:17,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 11:01:17,639 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-15 11:01:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:17,639 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 11:01:17,640 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 11:01:17,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 11:01:21,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 11:01:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 11:01:21,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:21,929 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:21,951 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-15 11:01:22,129 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-15 11:01:22,129 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-15 11:01:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:22,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257225856] [2022-04-15 11:01:22,242 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:22,243 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:22,243 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-15 11:01:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:22,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122301463] [2022-04-15 11:01:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:22,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:22,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634874982] [2022-04-15 11:01:22,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:01:22,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:22,265 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-15 11:01:22,266 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-15 11:01:22,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:01:22,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:22,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 11:01:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:22,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:22,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-15 11:01:22,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1504#true} is VALID [2022-04-15 11:01:22,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:01:22,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-15 11:01:22,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-15 11:01:22,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1504#true} is VALID [2022-04-15 11:01:22,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-15 11:01:22,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:01:22,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:01:22,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:01:22,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-15 11:01:22,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:22,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:22,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:22,588 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-15 11:01:22,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:01:22,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:01:22,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:01:22,590 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:22,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 11:01:22,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 11:01:22,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 11:01:22,591 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-15 11:01:22,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:01:22,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:01:22,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:01:22,592 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 11:01:22,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 11:01:22,592 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1504#true} is VALID [2022-04-15 11:01:22,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-15 11:01:22,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-15 11:01:22,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 11:01:22,593 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 11:01:22,594 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:01:22,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:01:22,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-15 11:01:22,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-15 11:01:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 11:01:22,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:22,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122301463] [2022-04-15 11:01:22,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:22,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634874982] [2022-04-15 11:01:22,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634874982] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:01:22,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:01:22,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 11:01:22,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:22,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257225856] [2022-04-15 11:01:22,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257225856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:22,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:22,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:01:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953209571] [2022-04-15 11:01:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-15 11:01:22,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:22,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 11:01:22,871 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-15 11:01:22,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:01:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:01:22,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:01:22,873 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 11:01:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:23,084 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 11:01:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:01:23,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-15 11:01:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 11:01:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 11:01:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 11:01:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-15 11:01:23,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-15 11:01:23,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:23,147 INFO L225 Difference]: With dead ends: 44 [2022-04-15 11:01:23,147 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 11:01:23,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:01:23,148 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:23,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:01:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 11:01:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 11:01:23,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:23,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:23,174 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:23,174 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:23,175 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 11:01:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 11:01:23,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:23,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:23,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-15 11:01:23,176 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-15 11:01:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:23,177 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 11:01:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 11:01:23,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:23,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:23,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:23,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 11:01:23,178 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-15 11:01:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:23,178 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 11:01:23,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 11:01:23,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 11:01:27,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 11:01:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 11:01:27,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:27,456 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:27,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 11:01:27,660 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-15 11:01:27,660 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-15 11:01:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:27,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401982722] [2022-04-15 11:01:27,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:27,762 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:27,762 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-15 11:01:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832221247] [2022-04-15 11:01:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:27,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:27,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973345584] [2022-04-15 11:01:27,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:01:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:27,777 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-15 11:01:27,791 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-15 11:01:27,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:01:27,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:27,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 11:01:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:27,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:28,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-15 11:01:28,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:28,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,008 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,009 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1967#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:28,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,011 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,012 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1992#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:28,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-15 11:01:28,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-15 11:01:28,014 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1926#false} is VALID [2022-04-15 11:01:28,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-15 11:01:28,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-15 11:01:28,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-15 11:01:28,015 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-15 11:01:28,015 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-15 11:01:28,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-15 11:01:28,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-15 11:01:28,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-15 11:01:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:01:28,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:28,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-15 11:01:28,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-15 11:01:28,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-15 11:01:28,239 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-15 11:01:28,239 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-15 11:01:28,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:01:28,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:01:28,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:01:28,243 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-15 11:01:28,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-15 11:01:28,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:01:28,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2079#(< ~counter~0 10)} is VALID [2022-04-15 11:01:28,246 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 10)} #55#return; {2079#(< ~counter~0 10)} is VALID [2022-04-15 11:01:28,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:01:28,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:01:28,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:01:28,249 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-15 11:01:28,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-15 11:01:28,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-15 11:01:28,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2104#(< ~counter~0 9)} is VALID [2022-04-15 11:01:28,251 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 9)} #55#return; {2104#(< ~counter~0 9)} is VALID [2022-04-15 11:01:28,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:01:28,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:01:28,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:01:28,251 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1925#true} is VALID [2022-04-15 11:01:28,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-15 11:01:28,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-15 11:01:28,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 8)} #53#return; {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-15 11:01:28,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-15 11:01:28,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-15 11:01:28,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-15 11:01:28,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 8)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 8)} call #t~ret6 := main(); {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 8)} {1925#true} #61#return; {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 8)} assume true; {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-15 11:01:28,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-15 11:01:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 11:01:28,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:28,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832221247] [2022-04-15 11:01:28,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:28,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973345584] [2022-04-15 11:01:28,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973345584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:01:28,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:01:28,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 11:01:28,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:28,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401982722] [2022-04-15 11:01:28,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401982722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:28,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:28,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:01:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385082691] [2022-04-15 11:01:28,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-15 11:01:28,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:28,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:28,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:28,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:01:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:01:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:01:28,285 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:28,416 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-15 11:01:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:01:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-15 11:01:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 11:01:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 11:01:28,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-15 11:01:28,462 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-15 11:01:28,463 INFO L225 Difference]: With dead ends: 54 [2022-04-15 11:01:28,463 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 11:01:28,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:01:28,464 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:28,464 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 11:01:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 11:01:28,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:28,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:28,497 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:28,497 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:28,498 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 11:01:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 11:01:28,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:28,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:28,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 11:01:28,499 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 11:01:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:28,500 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 11:01:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 11:01:28,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:28,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:28,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:28,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 11:01:28,501 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-15 11:01:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:28,502 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 11:01:28,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 11:01:28,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 11:01:32,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 11:01:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 11:01:32,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:32,771 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:32,791 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-15 11:01:32,971 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-15 11:01:32,972 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:32,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-15 11:01:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:32,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886452512] [2022-04-15 11:01:33,074 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:33,074 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:33,074 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-15 11:01:33,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:33,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211273846] [2022-04-15 11:01:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:33,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:33,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448071949] [2022-04-15 11:01:33,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:01:33,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:33,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:33,085 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-15 11:01:33,086 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-15 11:01:33,116 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:01:33,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:33,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 11:01:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:33,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:33,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-15 11:01:33,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2456#true} is VALID [2022-04-15 11:01:33,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:01:33,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-15 11:01:33,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-15 11:01:33,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:33,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:33,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:33,457 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-15 11:01:33,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:01:33,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:01:33,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:01:33,458 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:33,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 11:01:33,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 11:01:33,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 11:01:33,460 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-15 11:01:33,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:01:33,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:01:33,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:01:33,461 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 11:01:33,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 11:01:33,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 11:01:33,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 11:01:33,462 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-15 11:01:33,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:01:33,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:01:33,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:01:33,463 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 11:01:33,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 11:01:33,464 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2456#true} is VALID [2022-04-15 11:01:33,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-15 11:01:33,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-15 11:01:33,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-15 11:01:33,465 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 11:01:33,465 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:01:33,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:01:33,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-15 11:01:33,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-15 11:01:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:01:33,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:33,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211273846] [2022-04-15 11:01:33,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:33,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448071949] [2022-04-15 11:01:33,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448071949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:01:33,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:01:33,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 11:01:33,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886452512] [2022-04-15 11:01:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886452512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:33,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:33,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:01:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96028516] [2022-04-15 11:01:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-15 11:01:33,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:33,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 11:01:33,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:33,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:01:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:33,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:01:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:01:33,845 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 11:01:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:34,163 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 11:01:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:01:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-15 11:01:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 11:01:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 11:01:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 11:01:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 11:01:34,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-15 11:01:34,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:34,210 INFO L225 Difference]: With dead ends: 52 [2022-04-15 11:01:34,210 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 11:01:34,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:01:34,211 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:34,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:01:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 11:01:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 11:01:34,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:34,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:34,248 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:34,248 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:34,250 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 11:01:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 11:01:34,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:34,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:34,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-15 11:01:34,250 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-15 11:01:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:34,251 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 11:01:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 11:01:34,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:34,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:34,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:34,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-15 11:01:34,253 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-15 11:01:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:34,253 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-15 11:01:34,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 11:01:34,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-15 11:01:38,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-15 11:01:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 11:01:38,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:38,566 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:38,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 11:01:38,767 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-15 11:01:38,768 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-15 11:01:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:38,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610227510] [2022-04-15 11:01:38,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:38,889 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:38,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-15 11:01:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:38,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398518042] [2022-04-15 11:01:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:38,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:38,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397904957] [2022-04-15 11:01:38,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:01:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:38,903 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-15 11:01:38,904 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-15 11:01:38,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:01:38,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:38,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 11:01:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:38,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:39,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-15 11:01:39,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:39,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,180 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,181 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2992#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:39,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,183 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,184 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3017#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:39,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,185 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,187 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3042#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:39,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-15 11:01:39,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-15 11:01:39,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-15 11:01:39,189 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-15 11:01:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:01:39,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:39,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-15 11:01:39,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-15 11:01:39,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-15 11:01:39,397 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-15 11:01:39,397 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-15 11:01:39,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:01:39,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:01:39,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:01:39,397 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-15 11:01:39,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-15 11:01:39,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:01:39,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3129#(< ~counter~0 10)} is VALID [2022-04-15 11:01:39,401 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 10)} #55#return; {3129#(< ~counter~0 10)} is VALID [2022-04-15 11:01:39,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:01:39,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:01:39,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:01:39,402 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-15 11:01:39,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-15 11:01:39,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-15 11:01:39,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3154#(< ~counter~0 9)} is VALID [2022-04-15 11:01:39,403 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 9)} #55#return; {3154#(< ~counter~0 9)} is VALID [2022-04-15 11:01:39,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:01:39,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:01:39,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:01:39,404 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-15 11:01:39,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-15 11:01:39,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-15 11:01:39,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3179#(< ~counter~0 8)} is VALID [2022-04-15 11:01:39,405 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 8)} #55#return; {3179#(< ~counter~0 8)} is VALID [2022-04-15 11:01:39,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:01:39,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:01:39,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:01:39,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2950#true} is VALID [2022-04-15 11:01:39,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-15 11:01:39,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-15 11:01:39,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 7)} #53#return; {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 11:01:39,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-15 11:01:39,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-15 11:01:39,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-15 11:01:39,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 7)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 7)} call #t~ret6 := main(); {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 7)} {2950#true} #61#return; {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 7)} assume true; {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-15 11:01:39,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-15 11:01:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:01:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:39,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398518042] [2022-04-15 11:01:39,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:39,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397904957] [2022-04-15 11:01:39,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397904957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:01:39,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:01:39,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 11:01:39,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:39,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610227510] [2022-04-15 11:01:39,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610227510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:39,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:39,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:01:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55624170] [2022-04-15 11:01:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-15 11:01:39,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:39,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:39,441 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-15 11:01:39,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:01:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:01:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:01:39,442 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:39,597 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-15 11:01:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:01:39,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-15 11:01:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 11:01:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 11:01:39,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-15 11:01:39,644 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-15 11:01:39,645 INFO L225 Difference]: With dead ends: 62 [2022-04-15 11:01:39,645 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 11:01:39,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:01:39,646 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:39,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 11:01:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 11:01:39,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:39,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:39,687 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:39,688 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:39,690 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 11:01:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 11:01:39,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:39,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:39,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-15 11:01:39,691 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-15 11:01:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:39,692 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 11:01:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 11:01:39,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:39,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:39,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:39,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-15 11:01:39,705 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-15 11:01:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:39,705 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-15 11:01:39,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 11:01:39,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-15 11:01:43,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 11:01:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:01:43,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:43,994 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:44,011 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-15 11:01:44,195 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-15 11:01:44,195 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-15 11:01:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [201741199] [2022-04-15 11:01:44,314 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:44,314 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:44,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-15 11:01:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:44,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032562394] [2022-04-15 11:01:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:44,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:44,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747442649] [2022-04-15 11:01:44,329 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:01:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:44,330 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-15 11:01:44,331 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-15 11:01:50,959 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 11:01:50,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:50,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 11:01:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:50,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:51,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-15 11:01:51,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3581#true} is VALID [2022-04-15 11:01:51,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-15 11:01:51,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-15 11:01:51,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:51,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:51,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:51,357 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-15 11:01:51,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:01:51,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:01:51,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,358 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:01:51,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:01:51,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:01:51,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:01:51,359 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-15 11:01:51,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:01:51,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:01:51,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,360 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:01:51,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:01:51,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:01:51,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:01:51,363 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-15 11:01:51,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:01:51,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:01:51,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,364 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:01:51,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 11:01:51,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 11:01:51,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 11:01:51,365 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-15 11:01:51,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:01:51,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:01:51,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,366 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 11:01:51,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 11:01:51,367 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3581#true} is VALID [2022-04-15 11:01:51,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-15 11:01:51,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-15 11:01:51,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-15 11:01:51,368 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 11:01:51,369 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:01:51,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:01:51,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-15 11:01:51,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-15 11:01:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 11:01:51,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:51,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:51,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032562394] [2022-04-15 11:01:51,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:51,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747442649] [2022-04-15 11:01:51,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747442649] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:01:51,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:01:51,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 11:01:51,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:51,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [201741199] [2022-04-15 11:01:51,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [201741199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:51,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:51,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:01:51,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687058448] [2022-04-15 11:01:51,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:51,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-15 11:01:51,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:51,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 11:01:51,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:51,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:01:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:51,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:01:51,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:01:51,754 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 11:01:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:52,147 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 11:01:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 11:01:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-15 11:01:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 11:01:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-15 11:01:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 11:01:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-15 11:01:52,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-15 11:01:52,187 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-15 11:01:52,191 INFO L225 Difference]: With dead ends: 60 [2022-04-15 11:01:52,191 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 11:01:52,192 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-15 11:01:52,192 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:52,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:01:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 11:01:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 11:01:52,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:52,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:52,252 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:52,252 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:52,253 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 11:01:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 11:01:52,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:52,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:52,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 11:01:52,254 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 11:01:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:52,255 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 11:01:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 11:01:52,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:52,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:52,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:52,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-15 11:01:52,256 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-15 11:01:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:52,257 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-15 11:01:52,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 11:01:52,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-15 11:01:56,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 11:01:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 11:01:56,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:01:56,545 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:01:56,553 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-15 11:01:56,746 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-15 11:01:56,749 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:01:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:01:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-15 11:01:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:56,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637125972] [2022-04-15 11:01:56,862 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:01:56,862 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:01:56,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:01:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-15 11:01:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:01:56,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417959627] [2022-04-15 11:01:56,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:01:56,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:01:56,887 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:01:56,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810362175] [2022-04-15 11:01:56,887 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:01:56,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:01:56,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:01:56,888 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-15 11:01:56,889 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-15 11:01:57,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 11:01:57,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:01:57,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 11:01:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:01:57,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:01:57,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-15 11:01:57,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-15 11:01:57,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,533 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,535 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4190#(<= ~counter~0 1)} is VALID [2022-04-15 11:01:57,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,536 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,537 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4215#(<= ~counter~0 2)} is VALID [2022-04-15 11:01:57,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,539 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,541 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4240#(<= ~counter~0 3)} is VALID [2022-04-15 11:01:57,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,542 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,542 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,544 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4265#(<= ~counter~0 4)} is VALID [2022-04-15 11:01:57,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-15 11:01:57,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 11:01:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:01:57,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:01:57,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-15 11:01:57,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-15 11:01:57,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-15 11:01:57,793 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-15 11:01:57,794 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-15 11:01:57,794 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:01:57,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:01:57,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:01:57,794 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-15 11:01:57,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-15 11:01:57,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:01:57,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4352#(< ~counter~0 10)} is VALID [2022-04-15 11:01:57,795 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 10)} #55#return; {4352#(< ~counter~0 10)} is VALID [2022-04-15 11:01:57,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:01:57,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:01:57,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:01:57,796 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-15 11:01:57,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-15 11:01:57,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-15 11:01:57,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(< ~counter~0 9)} is VALID [2022-04-15 11:01:57,797 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 9)} #55#return; {4377#(< ~counter~0 9)} is VALID [2022-04-15 11:01:57,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:01:57,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:01:57,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:01:57,797 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-15 11:01:57,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-15 11:01:57,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-15 11:01:57,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4402#(< ~counter~0 8)} is VALID [2022-04-15 11:01:57,799 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 8)} #55#return; {4402#(< ~counter~0 8)} is VALID [2022-04-15 11:01:57,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:01:57,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:01:57,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:01:57,799 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-15 11:01:57,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-15 11:01:57,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-15 11:01:57,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4427#(< ~counter~0 7)} is VALID [2022-04-15 11:01:57,801 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 7)} #55#return; {4427#(< ~counter~0 7)} is VALID [2022-04-15 11:01:57,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:01:57,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:01:57,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:01:57,801 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4148#true} is VALID [2022-04-15 11:01:57,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-15 11:01:57,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-15 11:01:57,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 6)} #53#return; {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-15 11:01:57,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-15 11:01:57,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-15 11:01:57,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-15 11:01:57,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 6)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 6)} call #t~ret6 := main(); {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 6)} {4148#true} #61#return; {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 6)} assume true; {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4452#(< ~counter~0 6)} is VALID [2022-04-15 11:01:57,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-15 11:01:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 11:01:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:01:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417959627] [2022-04-15 11:01:57,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:01:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810362175] [2022-04-15 11:01:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810362175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:01:57,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:01:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 11:01:57,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:01:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637125972] [2022-04-15 11:01:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637125972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:01:57,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:01:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:01:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169776496] [2022-04-15 11:01:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:01:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-15 11:01:57,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:01:57,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:57,853 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-15 11:01:57,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:01:57,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:01:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:01:57,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:01:57,859 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:58,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:58,049 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-15 11:01:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:01:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-15 11:01:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:01:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-15 11:01:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-15 11:01:58,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-15 11:01:58,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:01:58,098 INFO L225 Difference]: With dead ends: 70 [2022-04-15 11:01:58,098 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 11:01:58,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:01:58,099 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:01:58,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:01:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 11:01:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 11:01:58,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:01:58,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:58,162 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:58,162 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:58,163 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 11:01:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 11:01:58,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:58,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:58,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-15 11:01:58,164 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-15 11:01:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:01:58,165 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 11:01:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 11:01:58,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:01:58,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:01:58,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:01:58,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:01:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:01:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-15 11:01:58,166 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-15 11:01:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:01:58,166 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-15 11:01:58,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 11:01:58,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-15 11:02:02,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 11:02:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 11:02:02,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:02,435 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:02,440 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-15 11:02:02,635 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-15 11:02:02,636 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-15 11:02:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977585871] [2022-04-15 11:02:02,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:02,741 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:02,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-15 11:02:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:02,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094593405] [2022-04-15 11:02:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:02,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:02,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016626088] [2022-04-15 11:02:02,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:02:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:02,767 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-15 11:02:02,783 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-15 11:02:03,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:02:03,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:03,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 11:02:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:03,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:03,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-15 11:02:03,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-15 11:02:03,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:03,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:03,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:03,721 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,722 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:03,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:02:03,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:02:03,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:02:03,723 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,724 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:02:03,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,725 INFO L272 TraceCheckUtils]: 30: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,726 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,727 INFO L272 TraceCheckUtils]: 38: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,728 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4879#true} {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-15 11:02:03,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 11:02:03,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 11:02:03,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 11:02:03,729 INFO L272 TraceCheckUtils]: 46: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,730 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,730 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 11:02:03,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 11:02:03,731 INFO L272 TraceCheckUtils]: 52: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4879#true} is VALID [2022-04-15 11:02:03,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-15 11:02:03,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-15 11:02:03,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-15 11:02:03,731 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 11:02:03,732 INFO L272 TraceCheckUtils]: 57: Hoare triple {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:02:03,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:03,733 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-15 11:02:03,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-15 11:02:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:02:03,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:04,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094593405] [2022-04-15 11:02:04,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:04,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016626088] [2022-04-15 11:02:04,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016626088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:04,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:04,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 11:02:04,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:04,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977585871] [2022-04-15 11:02:04,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977585871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:04,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:04,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:02:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829336169] [2022-04-15 11:02:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-15 11:02:04,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:04,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 11:02:04,243 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-15 11:02:04,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:02:04,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:02:04,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:02:04,244 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 11:02:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:04,747 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 11:02:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:02:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-15 11:02:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 11:02:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 11:02:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 11:02:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-15 11:02:04,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-15 11:02:04,790 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-15 11:02:04,791 INFO L225 Difference]: With dead ends: 68 [2022-04-15 11:02:04,791 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 11:02:04,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:02:04,792 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:04,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:02:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 11:02:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 11:02:04,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:04,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:04,854 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:04,855 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:04,856 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-15 11:02:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 11:02:04,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:04,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:04,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-15 11:02:04,856 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-15 11:02:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:04,857 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-15 11:02:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 11:02:04,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:04,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:04,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:04,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-15 11:02:04,858 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-15 11:02:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:04,859 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-15 11:02:04,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 11:02:04,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-15 11:02:09,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 11:02:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 11:02:09,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:09,142 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:09,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 11:02:09,343 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-15 11:02:09,343 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-15 11:02:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:09,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571102773] [2022-04-15 11:02:09,434 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:09,434 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:09,434 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-15 11:02:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:09,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042210727] [2022-04-15 11:02:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:09,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:09,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652461271] [2022-04-15 11:02:09,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:02:09,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:09,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:09,444 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-15 11:02:09,445 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-15 11:02:09,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:02:09,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:09,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 11:02:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:09,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:09,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-15 11:02:09,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {5602#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,774 INFO L272 TraceCheckUtils]: 6: Hoare triple {5602#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {5602#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:09,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {5602#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,777 INFO L272 TraceCheckUtils]: 14: Hoare triple {5636#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,778 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5636#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:09,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,779 INFO L272 TraceCheckUtils]: 22: Hoare triple {5661#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5661#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:09,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,782 INFO L272 TraceCheckUtils]: 30: Hoare triple {5686#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,783 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {5686#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5686#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:09,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,784 INFO L272 TraceCheckUtils]: 38: Hoare triple {5711#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,785 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {5711#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:09,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,787 INFO L272 TraceCheckUtils]: 46: Hoare triple {5736#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,789 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:09,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5761#(<= |main_#t~post5| 5)} is VALID [2022-04-15 11:02:09,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-15 11:02:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:02:09,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:10,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-15 11:02:10,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-15 11:02:10,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-15 11:02:10,078 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-15 11:02:10,078 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-15 11:02:10,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,079 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,079 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-15 11:02:10,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:02:10,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5823#(< ~counter~0 10)} is VALID [2022-04-15 11:02:10,080 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 10)} #55#return; {5823#(< ~counter~0 10)} is VALID [2022-04-15 11:02:10,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,080 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-15 11:02:10,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-15 11:02:10,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5848#(< ~counter~0 9)} is VALID [2022-04-15 11:02:10,082 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 9)} #55#return; {5848#(< ~counter~0 9)} is VALID [2022-04-15 11:02:10,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,082 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-15 11:02:10,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-15 11:02:10,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5873#(< ~counter~0 8)} is VALID [2022-04-15 11:02:10,084 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 8)} #55#return; {5873#(< ~counter~0 8)} is VALID [2022-04-15 11:02:10,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,084 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-15 11:02:10,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-15 11:02:10,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5898#(< ~counter~0 7)} is VALID [2022-04-15 11:02:10,085 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 7)} #55#return; {5898#(< ~counter~0 7)} is VALID [2022-04-15 11:02:10,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,086 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-15 11:02:10,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-15 11:02:10,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {5736#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:10,087 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:10,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,087 INFO L272 TraceCheckUtils]: 14: Hoare triple {5736#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:10,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:10,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {5711#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5711#(<= ~counter~0 4)} #53#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-15 11:02:10,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-15 11:02:10,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-15 11:02:10,089 INFO L272 TraceCheckUtils]: 6: Hoare triple {5711#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-15 11:02:10,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(<= ~counter~0 4)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {5711#(<= ~counter~0 4)} call #t~ret6 := main(); {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#(<= ~counter~0 4)} {5594#true} #61#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5711#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:10,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-15 11:02:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:02:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:10,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042210727] [2022-04-15 11:02:10,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:10,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652461271] [2022-04-15 11:02:10,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652461271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:10,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:10,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 11:02:10,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:10,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571102773] [2022-04-15 11:02:10,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571102773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:10,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:10,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:02:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938494755] [2022-04-15 11:02:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:10,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-15 11:02:10,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:10,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:02:10,154 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-15 11:02:10,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:02:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:02:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:02:10,155 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:02:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:10,378 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 11:02:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:02:10,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-15 11:02:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:02:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-15 11:02:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:02:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-15 11:02:10,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-15 11:02:10,430 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-15 11:02:10,431 INFO L225 Difference]: With dead ends: 78 [2022-04-15 11:02:10,431 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 11:02:10,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:02:10,432 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:10,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:02:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 11:02:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-15 11:02:10,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:10,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:10,499 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:10,499 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:10,500 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 11:02:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 11:02:10,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:10,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:10,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-15 11:02:10,500 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-15 11:02:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:10,501 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 11:02:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 11:02:10,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:10,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:10,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:10,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-15 11:02:10,503 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-15 11:02:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:10,503 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-15 11:02:10,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 11:02:10,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-15 11:02:14,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-15 11:02:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 11:02:14,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:14,759 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:14,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:14,963 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-15 11:02:14,963 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-15 11:02:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:14,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342312423] [2022-04-15 11:02:15,051 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:15,051 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:15,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-15 11:02:15,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:15,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083399759] [2022-04-15 11:02:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:15,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:15,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:15,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592478017] [2022-04-15 11:02:15,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:02:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:15,063 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-15 11:02:15,064 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-15 11:02:15,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:02:15,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:15,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 11:02:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:15,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:15,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #61#return; {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret6 := main(); {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {6423#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6423#true} {6423#true} #53#return; {6423#true} is VALID [2022-04-15 11:02:15,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:15,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:15,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:15,496 INFO L272 TraceCheckUtils]: 14: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,497 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6423#true} {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:15,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:15,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:15,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:15,498 INFO L272 TraceCheckUtils]: 22: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,499 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6423#true} {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:15,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:15,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:15,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:15,500 INFO L272 TraceCheckUtils]: 30: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,501 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6423#true} {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:15,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:15,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:15,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:15,502 INFO L272 TraceCheckUtils]: 38: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,502 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6423#true} {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:15,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 11:02:15,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 11:02:15,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 11:02:15,504 INFO L272 TraceCheckUtils]: 46: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,504 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6423#true} {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-15 11:02:15,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 11:02:15,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 11:02:15,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 11:02:15,506 INFO L272 TraceCheckUtils]: 54: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,506 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6423#true} {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 11:02:15,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 11:02:15,507 INFO L272 TraceCheckUtils]: 60: Hoare triple {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-15 11:02:15,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-15 11:02:15,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-15 11:02:15,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-15 11:02:15,508 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6423#true} {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 11:02:15,509 INFO L272 TraceCheckUtils]: 65: Hoare triple {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:02:15,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:15,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {6634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6424#false} is VALID [2022-04-15 11:02:15,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-15 11:02:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 11:02:15,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083399759] [2022-04-15 11:02:15,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592478017] [2022-04-15 11:02:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592478017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:15,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 11:02:15,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342312423] [2022-04-15 11:02:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342312423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:02:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372856045] [2022-04-15 11:02:15,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:15,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-15 11:02:15,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:15,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 11:02:15,854 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-15 11:02:15,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:02:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:15,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:02:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:02:15,855 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 11:02:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:16,400 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 11:02:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:02:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-15 11:02:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 11:02:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 11:02:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 11:02:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-15 11:02:16,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-15 11:02:16,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:16,452 INFO L225 Difference]: With dead ends: 76 [2022-04-15 11:02:16,452 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 11:02:16,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:02:16,453 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:16,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:02:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 11:02:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 11:02:16,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:16,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:16,528 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:16,528 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:16,529 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-15 11:02:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 11:02:16,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:16,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:16,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-15 11:02:16,530 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-15 11:02:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:16,531 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-15 11:02:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 11:02:16,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:16,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:16,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:16,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-15 11:02:16,534 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-15 11:02:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:16,534 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-15 11:02:16,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 11:02:16,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-15 11:02:20,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 11:02:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 11:02:20,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:20,797 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:20,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 11:02:21,003 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-15 11:02:21,003 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-15 11:02:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:21,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642471576] [2022-04-15 11:02:21,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:21,107 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:21,107 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:21,108 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-15 11:02:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:21,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046263447] [2022-04-15 11:02:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:21,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:21,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044353803] [2022-04-15 11:02:21,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:02:21,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:21,130 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-15 11:02:21,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 11:02:21,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:02:21,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:21,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 11:02:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:21,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:21,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-15 11:02:21,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7144#(<= ~counter~0 0)} {7136#true} #61#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {7144#(<= ~counter~0 0)} call #t~ret6 := main(); {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {7144#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= ~counter~0 0)} ~cond := #in~cond; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= ~counter~0 0)} assume !(0 == ~cond); {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7144#(<= ~counter~0 0)} {7144#(<= ~counter~0 0)} #53#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7144#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:21,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,507 INFO L272 TraceCheckUtils]: 14: Hoare triple {7178#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= ~counter~0 1)} ~cond := #in~cond; {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {7178#(<= ~counter~0 1)} assume !(0 == ~cond); {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {7178#(<= ~counter~0 1)} assume true; {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,509 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7178#(<= ~counter~0 1)} {7178#(<= ~counter~0 1)} #55#return; {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {7178#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7178#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:21,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {7178#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {7203#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,510 INFO L272 TraceCheckUtils]: 22: Hoare triple {7203#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {7203#(<= ~counter~0 2)} ~cond := #in~cond; {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {7203#(<= ~counter~0 2)} assume !(0 == ~cond); {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {7203#(<= ~counter~0 2)} assume true; {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,511 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7203#(<= ~counter~0 2)} {7203#(<= ~counter~0 2)} #55#return; {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {7203#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7203#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:21,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {7203#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {7228#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,513 INFO L272 TraceCheckUtils]: 30: Hoare triple {7228#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {7228#(<= ~counter~0 3)} ~cond := #in~cond; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {7228#(<= ~counter~0 3)} assume !(0 == ~cond); {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,514 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7228#(<= ~counter~0 3)} {7228#(<= ~counter~0 3)} #55#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {7228#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,515 INFO L272 TraceCheckUtils]: 38: Hoare triple {7253#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {7253#(<= ~counter~0 4)} ~cond := #in~cond; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {7253#(<= ~counter~0 4)} assume !(0 == ~cond); {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {7253#(<= ~counter~0 4)} assume true; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,516 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7253#(<= ~counter~0 4)} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {7253#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,518 INFO L272 TraceCheckUtils]: 46: Hoare triple {7278#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {7278#(<= ~counter~0 5)} ~cond := #in~cond; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {7278#(<= ~counter~0 5)} assume !(0 == ~cond); {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {7278#(<= ~counter~0 5)} assume true; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,519 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7278#(<= ~counter~0 5)} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {7278#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,520 INFO L272 TraceCheckUtils]: 54: Hoare triple {7303#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {7303#(<= ~counter~0 6)} ~cond := #in~cond; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {7303#(<= ~counter~0 6)} assume !(0 == ~cond); {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {7303#(<= ~counter~0 6)} assume true; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,524 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7303#(<= ~counter~0 6)} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,525 INFO L290 TraceCheckUtils]: 59: Hoare triple {7303#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7328#(<= |main_#t~post5| 6)} is VALID [2022-04-15 11:02:21,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {7328#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-15 11:02:21,525 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7137#false} is VALID [2022-04-15 11:02:21,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {7137#false} assume !(0 == ~cond); {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {7137#false} assume true; {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7137#false} {7137#false} #57#return; {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-15 11:02:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:02:21,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:21,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-15 11:02:21,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-15 11:02:21,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-15 11:02:21,832 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-15 11:02:21,832 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7136#true} {7137#false} #57#return; {7137#false} is VALID [2022-04-15 11:02:21,832 INFO L290 TraceCheckUtils]: 65: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,832 INFO L290 TraceCheckUtils]: 64: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,832 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,832 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {7386#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-15 11:02:21,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {7390#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7386#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:02:21,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {7390#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7390#(< ~counter~0 10)} is VALID [2022-04-15 11:02:21,833 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7136#true} {7390#(< ~counter~0 10)} #55#return; {7390#(< ~counter~0 10)} is VALID [2022-04-15 11:02:21,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,833 INFO L272 TraceCheckUtils]: 54: Hoare triple {7390#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {7390#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-15 11:02:21,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {7415#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-15 11:02:21,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {7415#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7415#(< ~counter~0 9)} is VALID [2022-04-15 11:02:21,835 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7415#(< ~counter~0 9)} #55#return; {7415#(< ~counter~0 9)} is VALID [2022-04-15 11:02:21,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,835 INFO L272 TraceCheckUtils]: 46: Hoare triple {7415#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {7415#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-15 11:02:21,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {7440#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-15 11:02:21,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {7440#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7440#(< ~counter~0 8)} is VALID [2022-04-15 11:02:21,837 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7136#true} {7440#(< ~counter~0 8)} #55#return; {7440#(< ~counter~0 8)} is VALID [2022-04-15 11:02:21,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,837 INFO L272 TraceCheckUtils]: 38: Hoare triple {7440#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {7440#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-15 11:02:21,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-15 11:02:21,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {7303#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,838 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7136#true} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,839 INFO L272 TraceCheckUtils]: 30: Hoare triple {7303#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:21,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {7278#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,840 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7136#true} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,840 INFO L272 TraceCheckUtils]: 22: Hoare triple {7278#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:21,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {7253#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,842 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7136#true} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,842 INFO L272 TraceCheckUtils]: 14: Hoare triple {7253#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:21,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {7228#(<= ~counter~0 3)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7228#(<= ~counter~0 3)} #53#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 11:02:21,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 11:02:21,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 11:02:21,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {7228#(<= ~counter~0 3)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-15 11:02:21,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#(<= ~counter~0 3)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#(<= ~counter~0 3)} call #t~ret6 := main(); {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#(<= ~counter~0 3)} {7136#true} #61#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7228#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:21,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-15 11:02:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 11:02:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:21,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046263447] [2022-04-15 11:02:21,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044353803] [2022-04-15 11:02:21,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044353803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:21,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 11:02:21,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:21,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1642471576] [2022-04-15 11:02:21,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1642471576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:21,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:21,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 11:02:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258820060] [2022-04-15 11:02:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-15 11:02:21,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:21,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:21,892 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-15 11:02:21,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 11:02:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 11:02:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:02:21,893 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:22,137 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-15 11:02:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 11:02:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-15 11:02:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-15 11:02:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-15 11:02:22,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-15 11:02:22,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:22,197 INFO L225 Difference]: With dead ends: 86 [2022-04-15 11:02:22,197 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 11:02:22,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-15 11:02:22,197 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:22,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:02:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 11:02:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-15 11:02:22,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:22,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:22,289 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:22,290 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:22,291 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 11:02:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 11:02:22,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:22,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:22,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-15 11:02:22,291 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-15 11:02:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:22,292 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 11:02:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 11:02:22,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:22,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:22,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:22,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-15 11:02:22,294 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-15 11:02:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:22,294 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-15 11:02:22,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 11:02:22,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-15 11:02:26,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-15 11:02:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 11:02:26,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:26,556 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:26,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:26,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:26,757 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-15 11:02:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:26,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329155544] [2022-04-15 11:02:26,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:26,847 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:26,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-15 11:02:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:26,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795657742] [2022-04-15 11:02:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:26,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:26,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103768141] [2022-04-15 11:02:26,856 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:02:26,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:26,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:26,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:02:26,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 11:02:32,209 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 11:02:32,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:32,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 11:02:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:32,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:32,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {8063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8063#true} {8063#true} #61#return; {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {8063#true} call #t~ret6 := main(); {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {8063#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L272 TraceCheckUtils]: 6: Hoare triple {8063#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8063#true} {8063#true} #53#return; {8063#true} is VALID [2022-04-15 11:02:32,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {8063#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:32,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:32,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:32,720 INFO L272 TraceCheckUtils]: 14: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,720 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:32,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:32,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:32,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:32,721 INFO L272 TraceCheckUtils]: 22: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,722 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8063#true} {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:02:32,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:32,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:32,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:32,723 INFO L272 TraceCheckUtils]: 30: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,724 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8063#true} {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-15 11:02:32,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:32,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:32,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:32,725 INFO L272 TraceCheckUtils]: 38: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,725 INFO L290 TraceCheckUtils]: 40: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,725 INFO L290 TraceCheckUtils]: 41: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,726 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8063#true} {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 11:02:32,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:32,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:32,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:32,727 INFO L272 TraceCheckUtils]: 46: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,728 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8063#true} {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:32,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-15 11:02:32,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-15 11:02:32,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 10);havoc #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-15 11:02:32,729 INFO L272 TraceCheckUtils]: 54: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,729 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8063#true} {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-15 11:02:32,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 11:02:32,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 11:02:32,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 11:02:32,731 INFO L272 TraceCheckUtils]: 62: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,731 INFO L290 TraceCheckUtils]: 65: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,731 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8063#true} {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 11:02:32,732 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 11:02:32,732 INFO L272 TraceCheckUtils]: 68: Hoare triple {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-15 11:02:32,732 INFO L290 TraceCheckUtils]: 69: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-15 11:02:32,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-15 11:02:32,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-15 11:02:32,735 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8063#true} {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 11:02:32,736 INFO L272 TraceCheckUtils]: 73: Hoare triple {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:02:32,736 INFO L290 TraceCheckUtils]: 74: Hoare triple {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:32,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {8299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8064#false} is VALID [2022-04-15 11:02:32,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2022-04-15 11:02:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 11:02:32,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795657742] [2022-04-15 11:02:33,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103768141] [2022-04-15 11:02:33,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103768141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:33,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:33,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 11:02:33,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329155544] [2022-04-15 11:02:33,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329155544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:33,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:33,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:02:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131916030] [2022-04-15 11:02:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:33,306 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-15 11:02:33,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:33,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 11:02:33,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:33,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:02:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:33,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:02:33,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:02:33,346 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 11:02:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:34,035 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 11:02:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 11:02:34,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-15 11:02:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 11:02:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 11:02:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 11:02:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-15 11:02:34,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-15 11:02:34,085 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-15 11:02:34,086 INFO L225 Difference]: With dead ends: 84 [2022-04-15 11:02:34,086 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 11:02:34,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 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-15 11:02:34,087 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:34,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 11:02:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 11:02:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 11:02:34,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:34,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:34,191 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:34,191 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:34,192 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 11:02:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 11:02:34,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:34,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:34,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-15 11:02:34,193 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-15 11:02:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:34,194 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 11:02:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 11:02:34,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:34,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:34,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:34,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-15 11:02:34,197 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-15 11:02:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:34,198 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-15 11:02:34,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 11:02:34,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-15 11:02:38,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 11:02:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 11:02:38,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:38,474 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:38,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:38,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 11:02:38,679 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-15 11:02:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050501309] [2022-04-15 11:02:38,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:38,787 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:38,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-15 11:02:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:38,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371030947] [2022-04-15 11:02:38,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:38,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:38,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329955354] [2022-04-15 11:02:38,797 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:02:38,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:38,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:38,798 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:02:38,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 11:02:38,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 11:02:38,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:38,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 11:02:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:38,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:39,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-15 11:02:39,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8957#(<= ~counter~0 0)} {8949#true} #61#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {8957#(<= ~counter~0 0)} call #t~ret6 := main(); {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {8957#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {8957#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {8957#(<= ~counter~0 0)} ~cond := #in~cond; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {8957#(<= ~counter~0 0)} assume !(0 == ~cond); {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8957#(<= ~counter~0 0)} {8957#(<= ~counter~0 0)} #53#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {8957#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8957#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:39,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {8991#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,328 INFO L272 TraceCheckUtils]: 14: Hoare triple {8991#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {8991#(<= ~counter~0 1)} ~cond := #in~cond; {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {8991#(<= ~counter~0 1)} assume !(0 == ~cond); {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {8991#(<= ~counter~0 1)} assume true; {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,329 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8991#(<= ~counter~0 1)} {8991#(<= ~counter~0 1)} #55#return; {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {8991#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8991#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:39,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {8991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {9016#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,331 INFO L272 TraceCheckUtils]: 22: Hoare triple {9016#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {9016#(<= ~counter~0 2)} ~cond := #in~cond; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {9016#(<= ~counter~0 2)} assume !(0 == ~cond); {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,332 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9016#(<= ~counter~0 2)} {9016#(<= ~counter~0 2)} #55#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {9016#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,333 INFO L272 TraceCheckUtils]: 30: Hoare triple {9041#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#(<= ~counter~0 3)} ~cond := #in~cond; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#(<= ~counter~0 3)} assume !(0 == ~cond); {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#(<= ~counter~0 3)} assume true; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,335 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9041#(<= ~counter~0 3)} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,336 INFO L272 TraceCheckUtils]: 38: Hoare triple {9066#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {9066#(<= ~counter~0 4)} ~cond := #in~cond; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {9066#(<= ~counter~0 4)} assume !(0 == ~cond); {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {9066#(<= ~counter~0 4)} assume true; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,337 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9066#(<= ~counter~0 4)} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {9066#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,339 INFO L272 TraceCheckUtils]: 46: Hoare triple {9091#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {9091#(<= ~counter~0 5)} ~cond := #in~cond; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {9091#(<= ~counter~0 5)} assume !(0 == ~cond); {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {9091#(<= ~counter~0 5)} assume true; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,340 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9091#(<= ~counter~0 5)} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {9091#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,341 INFO L272 TraceCheckUtils]: 54: Hoare triple {9116#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {9116#(<= ~counter~0 6)} ~cond := #in~cond; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {9116#(<= ~counter~0 6)} assume !(0 == ~cond); {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {9116#(<= ~counter~0 6)} assume true; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,342 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9116#(<= ~counter~0 6)} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {9116#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,344 INFO L272 TraceCheckUtils]: 62: Hoare triple {9141#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {9141#(<= ~counter~0 7)} ~cond := #in~cond; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {9141#(<= ~counter~0 7)} assume !(0 == ~cond); {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,345 INFO L290 TraceCheckUtils]: 65: Hoare triple {9141#(<= ~counter~0 7)} assume true; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,345 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9141#(<= ~counter~0 7)} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,345 INFO L290 TraceCheckUtils]: 67: Hoare triple {9141#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9166#(<= |main_#t~post5| 7)} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {9166#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 71: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {8950#false} assume !(0 == ~cond); {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {8950#false} assume true; {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8950#false} {8950#false} #57#return; {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-15 11:02:39,346 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-15 11:02:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:02:39,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:39,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-15 11:02:39,671 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-15 11:02:39,671 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-15 11:02:39,671 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-15 11:02:39,671 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8949#true} {8950#false} #57#return; {8950#false} is VALID [2022-04-15 11:02:39,671 INFO L290 TraceCheckUtils]: 73: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,671 INFO L290 TraceCheckUtils]: 72: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,671 INFO L290 TraceCheckUtils]: 71: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,671 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {9224#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-15 11:02:39,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {9228#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:02:39,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {9228#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9228#(< ~counter~0 10)} is VALID [2022-04-15 11:02:39,673 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8949#true} {9228#(< ~counter~0 10)} #55#return; {9228#(< ~counter~0 10)} is VALID [2022-04-15 11:02:39,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,673 INFO L290 TraceCheckUtils]: 63: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,673 INFO L272 TraceCheckUtils]: 62: Hoare triple {9228#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {9228#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-15 11:02:39,674 INFO L290 TraceCheckUtils]: 60: Hoare triple {9253#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-15 11:02:39,675 INFO L290 TraceCheckUtils]: 59: Hoare triple {9253#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9253#(< ~counter~0 9)} is VALID [2022-04-15 11:02:39,675 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8949#true} {9253#(< ~counter~0 9)} #55#return; {9253#(< ~counter~0 9)} is VALID [2022-04-15 11:02:39,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,675 INFO L272 TraceCheckUtils]: 54: Hoare triple {9253#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {9253#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-15 11:02:39,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-15 11:02:39,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {9141#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,677 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8949#true} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,677 INFO L290 TraceCheckUtils]: 47: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,677 INFO L272 TraceCheckUtils]: 46: Hoare triple {9141#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:39,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {9116#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,678 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8949#true} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,679 INFO L272 TraceCheckUtils]: 38: Hoare triple {9116#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:39,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,680 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8949#true} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,681 INFO L272 TraceCheckUtils]: 30: Hoare triple {9091#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:39,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,682 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8949#true} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,682 INFO L272 TraceCheckUtils]: 22: Hoare triple {9066#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:39,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,684 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8949#true} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,684 INFO L272 TraceCheckUtils]: 14: Hoare triple {9041#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:39,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {9016#(<= ~counter~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8949#true} {9016#(<= ~counter~0 2)} #53#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-15 11:02:39,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-15 11:02:39,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-15 11:02:39,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {9016#(<= ~counter~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8949#true} is VALID [2022-04-15 11:02:39,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {9016#(<= ~counter~0 2)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {9016#(<= ~counter~0 2)} call #t~ret6 := main(); {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9016#(<= ~counter~0 2)} {8949#true} #61#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9016#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:39,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-15 11:02:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 11:02:39,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:39,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371030947] [2022-04-15 11:02:39,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:39,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329955354] [2022-04-15 11:02:39,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329955354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:39,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:39,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-15 11:02:39,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:39,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050501309] [2022-04-15 11:02:39,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050501309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:39,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:39,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:02:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404874293] [2022-04-15 11:02:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-15 11:02:39,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:39,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:39,758 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-15 11:02:39,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:02:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:39,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:02:39,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:02:39,759 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:40,042 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-15 11:02:40,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:02:40,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-15 11:02:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-15 11:02:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-15 11:02:40,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-15 11:02:40,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:40,163 INFO L225 Difference]: With dead ends: 94 [2022-04-15 11:02:40,163 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 11:02:40,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-15 11:02:40,164 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:40,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:02:40,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 11:02:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-15 11:02:40,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:40,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:40,256 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:40,256 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:40,257 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 11:02:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 11:02:40,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:40,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:40,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-15 11:02:40,258 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-15 11:02:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:40,259 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 11:02:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 11:02:40,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:40,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:40,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:40,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-15 11:02:40,260 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-15 11:02:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:40,261 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-15 11:02:40,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 11:02:40,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-15 11:02:44,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 11:02:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 11:02:44,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:44,527 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:44,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:44,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 11:02:44,732 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-15 11:02:44,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:44,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531634097] [2022-04-15 11:02:44,826 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:44,826 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:44,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-15 11:02:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851192191] [2022-04-15 11:02:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:44,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:44,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261406389] [2022-04-15 11:02:44,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:02:44,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:44,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:44,840 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:02:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 11:02:45,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:02:45,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:45,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 11:02:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:45,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:46,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {9974#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #61#return; {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret6 := main(); {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {9974#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L272 TraceCheckUtils]: 6: Hoare triple {9974#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9974#true} {9974#true} #53#return; {9974#true} is VALID [2022-04-15 11:02:46,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {9974#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:46,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:46,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:46,364 INFO L272 TraceCheckUtils]: 14: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,364 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9974#true} {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:46,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 11:02:46,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 11:02:46,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 11:02:46,365 INFO L272 TraceCheckUtils]: 22: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,366 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9974#true} {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 11:02:46,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 11:02:46,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 11:02:46,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 11:02:46,367 INFO L272 TraceCheckUtils]: 30: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,368 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9974#true} {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-15 11:02:46,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:46,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:46,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:46,369 INFO L272 TraceCheckUtils]: 38: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,370 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9974#true} {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:46,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-15 11:02:46,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-15 11:02:46,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-15 11:02:46,371 INFO L272 TraceCheckUtils]: 46: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,371 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9974#true} {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-15 11:02:46,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,372 INFO L272 TraceCheckUtils]: 54: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,373 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9974#true} {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,374 INFO L290 TraceCheckUtils]: 60: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,374 INFO L290 TraceCheckUtils]: 61: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,374 INFO L272 TraceCheckUtils]: 62: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,374 INFO L290 TraceCheckUtils]: 65: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,375 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9974#true} {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 11:02:46,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-15 11:02:46,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-15 11:02:46,376 INFO L290 TraceCheckUtils]: 69: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-15 11:02:46,376 INFO L272 TraceCheckUtils]: 70: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,376 INFO L290 TraceCheckUtils]: 71: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,376 INFO L290 TraceCheckUtils]: 72: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,376 INFO L290 TraceCheckUtils]: 73: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,377 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9974#true} {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-15 11:02:46,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-15 11:02:46,377 INFO L272 TraceCheckUtils]: 76: Hoare triple {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-15 11:02:46,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-15 11:02:46,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-15 11:02:46,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-15 11:02:46,378 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9974#true} {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-15 11:02:46,379 INFO L272 TraceCheckUtils]: 81: Hoare triple {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:02:46,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:46,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {10235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9975#false} is VALID [2022-04-15 11:02:46,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2022-04-15 11:02:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 11:02:46,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851192191] [2022-04-15 11:02:46,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261406389] [2022-04-15 11:02:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261406389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:46,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:46,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 11:02:46,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531634097] [2022-04-15 11:02:46,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531634097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:46,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:46,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:02:46,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028174917] [2022-04-15 11:02:46,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-15 11:02:46,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:46,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 11:02:46,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:46,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:02:46,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:46,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:02:46,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:02:46,694 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 11:02:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:47,490 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 11:02:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:02:47,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-15 11:02:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 11:02:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-15 11:02:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 11:02:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-15 11:02:47,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-15 11:02:47,546 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-15 11:02:47,547 INFO L225 Difference]: With dead ends: 92 [2022-04-15 11:02:47,547 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 11:02:47,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-15 11:02:47,548 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:47,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 11:02:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 11:02:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 11:02:47,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:47,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:47,642 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:47,642 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:47,643 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-15 11:02:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 11:02:47,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:47,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:47,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-15 11:02:47,644 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-15 11:02:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:47,645 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-15 11:02:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 11:02:47,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:47,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:47,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:47,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-15 11:02:47,647 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-15 11:02:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:47,647 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-15 11:02:47,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 11:02:47,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-15 11:02:51,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-15 11:02:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 11:02:51,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:51,913 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:51,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:52,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 11:02:52,119 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-15 11:02:52,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:52,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8863188] [2022-04-15 11:02:52,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:52,212 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:52,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-15 11:02:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977716316] [2022-04-15 11:02:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:52,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:52,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440870200] [2022-04-15 11:02:52,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 11:02:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:52,229 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:02:52,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 11:02:52,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 11:02:52,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:52,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 11:02:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:52,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:52,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-15 11:02:52,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10841#(<= ~counter~0 0)} {10833#true} #61#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {10841#(<= ~counter~0 0)} call #t~ret6 := main(); {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {10841#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {10841#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {10841#(<= ~counter~0 0)} ~cond := #in~cond; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {10841#(<= ~counter~0 0)} assume !(0 == ~cond); {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10841#(<= ~counter~0 0)} {10841#(<= ~counter~0 0)} #53#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {10841#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10841#(<= ~counter~0 0)} is VALID [2022-04-15 11:02:52,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {10841#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {10875#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,693 INFO L272 TraceCheckUtils]: 14: Hoare triple {10875#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {10875#(<= ~counter~0 1)} ~cond := #in~cond; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {10875#(<= ~counter~0 1)} assume !(0 == ~cond); {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,694 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10875#(<= ~counter~0 1)} {10875#(<= ~counter~0 1)} #55#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {10875#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:52,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,695 INFO L272 TraceCheckUtils]: 22: Hoare triple {10900#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {10900#(<= ~counter~0 2)} ~cond := #in~cond; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {10900#(<= ~counter~0 2)} assume !(0 == ~cond); {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {10900#(<= ~counter~0 2)} assume true; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,696 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10900#(<= ~counter~0 2)} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {10900#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:52,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,698 INFO L272 TraceCheckUtils]: 30: Hoare triple {10925#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {10925#(<= ~counter~0 3)} ~cond := #in~cond; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(<= ~counter~0 3)} assume !(0 == ~cond); {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {10925#(<= ~counter~0 3)} assume true; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,700 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10925#(<= ~counter~0 3)} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {10925#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:52,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,702 INFO L272 TraceCheckUtils]: 38: Hoare triple {10950#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {10950#(<= ~counter~0 4)} ~cond := #in~cond; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {10950#(<= ~counter~0 4)} assume !(0 == ~cond); {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {10950#(<= ~counter~0 4)} assume true; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,703 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10950#(<= ~counter~0 4)} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {10950#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:52,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,704 INFO L272 TraceCheckUtils]: 46: Hoare triple {10975#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {10975#(<= ~counter~0 5)} ~cond := #in~cond; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {10975#(<= ~counter~0 5)} assume !(0 == ~cond); {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {10975#(<= ~counter~0 5)} assume true; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,706 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10975#(<= ~counter~0 5)} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,706 INFO L290 TraceCheckUtils]: 51: Hoare triple {10975#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:52,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,707 INFO L272 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,707 INFO L290 TraceCheckUtils]: 55: Hoare triple {11000#(<= ~counter~0 6)} ~cond := #in~cond; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 6)} assume !(0 == ~cond); {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 6)} assume true; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,708 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11000#(<= ~counter~0 6)} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:52,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,710 INFO L272 TraceCheckUtils]: 62: Hoare triple {11025#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {11025#(<= ~counter~0 7)} ~cond := #in~cond; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {11025#(<= ~counter~0 7)} assume !(0 == ~cond); {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {11025#(<= ~counter~0 7)} assume true; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,711 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11025#(<= ~counter~0 7)} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {11025#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:52,712 INFO L290 TraceCheckUtils]: 68: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,716 INFO L272 TraceCheckUtils]: 70: Hoare triple {11050#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,716 INFO L290 TraceCheckUtils]: 71: Hoare triple {11050#(<= ~counter~0 8)} ~cond := #in~cond; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,716 INFO L290 TraceCheckUtils]: 72: Hoare triple {11050#(<= ~counter~0 8)} assume !(0 == ~cond); {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {11050#(<= ~counter~0 8)} assume true; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,717 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11050#(<= ~counter~0 8)} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,718 INFO L290 TraceCheckUtils]: 75: Hoare triple {11050#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:52,718 INFO L290 TraceCheckUtils]: 76: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11075#(<= |main_#t~post5| 8)} is VALID [2022-04-15 11:02:52,718 INFO L290 TraceCheckUtils]: 77: Hoare triple {11075#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-15 11:02:52,718 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {10834#false} assume !(0 == ~cond); {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {10834#false} assume true; {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10834#false} {10834#false} #57#return; {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-15 11:02:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:02:52,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:53,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-15 11:02:53,065 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-15 11:02:53,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-15 11:02:53,065 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-15 11:02:53,065 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10833#true} {10834#false} #57#return; {10834#false} is VALID [2022-04-15 11:02:53,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,065 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {11133#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-15 11:02:53,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {11137#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11133#(< |main_#t~post5| 10)} is VALID [2022-04-15 11:02:53,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {11137#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11137#(< ~counter~0 10)} is VALID [2022-04-15 11:02:53,067 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10833#true} {11137#(< ~counter~0 10)} #55#return; {11137#(< ~counter~0 10)} is VALID [2022-04-15 11:02:53,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,067 INFO L290 TraceCheckUtils]: 72: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,067 INFO L290 TraceCheckUtils]: 71: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,067 INFO L272 TraceCheckUtils]: 70: Hoare triple {11137#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {11137#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-15 11:02:53,068 INFO L290 TraceCheckUtils]: 68: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-15 11:02:53,068 INFO L290 TraceCheckUtils]: 67: Hoare triple {11050#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:53,069 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10833#true} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:53,069 INFO L290 TraceCheckUtils]: 65: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,069 INFO L290 TraceCheckUtils]: 64: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,069 INFO L272 TraceCheckUtils]: 62: Hoare triple {11050#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:53,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-15 11:02:53,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {11025#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:53,081 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10833#true} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:53,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,082 INFO L272 TraceCheckUtils]: 54: Hoare triple {11025#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:53,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-15 11:02:53,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:53,084 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10833#true} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:53,084 INFO L290 TraceCheckUtils]: 49: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,084 INFO L290 TraceCheckUtils]: 47: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,084 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:53,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-15 11:02:53,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:53,086 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10833#true} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:53,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,086 INFO L272 TraceCheckUtils]: 38: Hoare triple {10975#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:53,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-15 11:02:53,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {10950#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:53,088 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10833#true} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:53,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,089 INFO L272 TraceCheckUtils]: 30: Hoare triple {10950#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:53,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-15 11:02:53,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {10925#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:53,091 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10833#true} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:53,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,091 INFO L272 TraceCheckUtils]: 22: Hoare triple {10925#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:53,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-15 11:02:53,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {10900#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:53,092 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10833#true} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:53,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,093 INFO L272 TraceCheckUtils]: 14: Hoare triple {10900#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:53,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-15 11:02:53,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {10875#(<= ~counter~0 1)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10833#true} {10875#(<= ~counter~0 1)} #53#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-15 11:02:53,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-15 11:02:53,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-15 11:02:53,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {10875#(<= ~counter~0 1)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10833#true} is VALID [2022-04-15 11:02:53,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {10875#(<= ~counter~0 1)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {10875#(<= ~counter~0 1)} call #t~ret6 := main(); {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10875#(<= ~counter~0 1)} {10833#true} #61#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10875#(<= ~counter~0 1)} is VALID [2022-04-15 11:02:53,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-15 11:02:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 11:02:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977716316] [2022-04-15 11:02:53,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440870200] [2022-04-15 11:02:53,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440870200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:02:53,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:02:53,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-15 11:02:53,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:53,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8863188] [2022-04-15 11:02:53,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8863188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:53,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:53,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:02:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758115656] [2022-04-15 11:02:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:53,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-15 11:02:53,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:53,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:53,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:53,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:02:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:02:53,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 11:02:53,169 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:53,493 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-15 11:02:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 11:02:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-15 11:02:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:02:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-15 11:02:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-15 11:02:53,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-15 11:02:53,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:53,570 INFO L225 Difference]: With dead ends: 102 [2022-04-15 11:02:53,570 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 11:02:53,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-15 11:02:53,572 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:02:53,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:02:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 11:02:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-15 11:02:53,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:02:53,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:53,683 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:53,683 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:53,684 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-15 11:02:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 11:02:53,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:53,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:53,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-15 11:02:53,685 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-15 11:02:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:02:53,686 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-15 11:02:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 11:02:53,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:02:53,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:02:53,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:02:53,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:02:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:02:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-15 11:02:53,689 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-15 11:02:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:02:53,689 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-15 11:02:53,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 11:02:53,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-15 11:02:57,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:02:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 11:02:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 11:02:57,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:02:57,978 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:02:57,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 11:02:58,178 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:58,178 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:02:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:02:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-15 11:02:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:58,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433296227] [2022-04-15 11:02:58,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:02:58,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:02:58,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:02:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-15 11:02:58,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:02:58,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501482946] [2022-04-15 11:02:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:02:58,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:02:58,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:02:58,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025522973] [2022-04-15 11:02:58,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:02:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:02:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:02:58,294 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:02:58,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 11:02:58,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:02:58,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:02:58,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 11:02:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:02:58,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:02:58,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {11956#true} call ULTIMATE.init(); {11956#true} is VALID [2022-04-15 11:02:58,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {11956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11956#true} is VALID [2022-04-15 11:02:58,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11956#true} {11956#true} #61#return; {11956#true} is VALID [2022-04-15 11:02:58,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {11956#true} call #t~ret6 := main(); {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {11956#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L272 TraceCheckUtils]: 6: Hoare triple {11956#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11956#true} {11956#true} #53#return; {11956#true} is VALID [2022-04-15 11:02:58,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {11956#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:58,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:58,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:58,809 INFO L272 TraceCheckUtils]: 14: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11956#true} {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:02:58,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:02:58,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:02:58,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:02:58,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,811 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11956#true} {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 11:02:58,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 11:02:58,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 11:02:58,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 11:02:58,813 INFO L272 TraceCheckUtils]: 30: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,813 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11956#true} {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 11:02:58,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:58,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:58,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:58,814 INFO L272 TraceCheckUtils]: 38: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,815 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11956#true} {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-15 11:02:58,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:02:58,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:02:58,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:02:58,816 INFO L272 TraceCheckUtils]: 46: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,816 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11956#true} {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:02:58,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 11:02:58,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 11:02:58,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 11:02:58,818 INFO L272 TraceCheckUtils]: 54: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,818 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11956#true} {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 11:02:58,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 11:02:58,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 11:02:58,819 INFO L290 TraceCheckUtils]: 61: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 11:02:58,819 INFO L272 TraceCheckUtils]: 62: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,819 INFO L290 TraceCheckUtils]: 63: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,820 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11956#true} {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-15 11:02:58,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:58,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:58,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:58,821 INFO L272 TraceCheckUtils]: 70: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,821 INFO L290 TraceCheckUtils]: 71: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,822 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11956#true} {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:02:58,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 11:02:58,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 11:02:58,823 INFO L290 TraceCheckUtils]: 77: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 11:02:58,823 INFO L272 TraceCheckUtils]: 78: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,823 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11956#true} {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 11:02:58,824 INFO L290 TraceCheckUtils]: 83: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 11:02:58,824 INFO L272 TraceCheckUtils]: 84: Hoare triple {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-15 11:02:58,824 INFO L290 TraceCheckUtils]: 85: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-15 11:02:58,824 INFO L290 TraceCheckUtils]: 86: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-15 11:02:58,824 INFO L290 TraceCheckUtils]: 87: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-15 11:02:58,824 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11956#true} {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 11:02:58,825 INFO L272 TraceCheckUtils]: 89: Hoare triple {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:02:58,826 INFO L290 TraceCheckUtils]: 90: Hoare triple {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:02:58,826 INFO L290 TraceCheckUtils]: 91: Hoare triple {12242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11957#false} is VALID [2022-04-15 11:02:58,826 INFO L290 TraceCheckUtils]: 92: Hoare triple {11957#false} assume !false; {11957#false} is VALID [2022-04-15 11:02:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 11:02:58,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:02:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:02:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501482946] [2022-04-15 11:02:59,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:02:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025522973] [2022-04-15 11:02:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025522973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:02:59,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:02:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 11:02:59,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:02:59,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433296227] [2022-04-15 11:02:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433296227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:02:59,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:02:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:02:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901891462] [2022-04-15 11:02:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:02:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-15 11:02:59,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:02:59,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 11:02:59,116 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-15 11:02:59,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:02:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:02:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:02:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 11:02:59,117 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 11:03:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:00,135 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-15 11:03:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:03:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-15 11:03:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 11:03:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-15 11:03:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 11:03:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-15 11:03:00,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-15 11:03:00,197 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-15 11:03:00,198 INFO L225 Difference]: With dead ends: 100 [2022-04-15 11:03:00,198 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 11:03:00,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:03:00,199 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:00,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 11:03:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 11:03:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-15 11:03:00,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:00,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:00,310 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:00,311 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:00,312 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-15 11:03:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 11:03:00,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:00,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:00,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-15 11:03:00,312 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-15 11:03:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:00,313 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-15 11:03:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 11:03:00,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:00,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:00,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:00,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-15 11:03:00,315 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-15 11:03:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:00,315 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-15 11:03:00,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 11:03:00,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-15 11:03:04,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-15 11:03:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 11:03:04,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:04,608 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:04,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 11:03:04,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:03:04,809 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-15 11:03:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:04,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144171389] [2022-04-15 11:03:04,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:03:04,888 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:03:04,888 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:03:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-15 11:03:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:04,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037064041] [2022-04-15 11:03:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:04,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:03:04,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579288558] [2022-04-15 11:03:04,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 11:03:04,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:03:04,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:03:04,901 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:03:04,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 11:03:04,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 11:03:04,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:03:04,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 11:03:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:03:04,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:03:05,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-15 11:03:05,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {12896#(<= ~counter~0 0)} ~cond := #in~cond; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {12896#(<= ~counter~0 0)} assume !(0 == ~cond); {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12896#(<= ~counter~0 0)} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,395 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {12930#(<= ~counter~0 1)} ~cond := #in~cond; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {12930#(<= ~counter~0 1)} assume !(0 == ~cond); {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= ~counter~0 1)} assume true; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,396 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12930#(<= ~counter~0 1)} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {12955#(<= ~counter~0 2)} ~cond := #in~cond; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {12955#(<= ~counter~0 2)} assume !(0 == ~cond); {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= ~counter~0 2)} assume true; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,401 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12955#(<= ~counter~0 2)} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,402 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {12980#(<= ~counter~0 3)} ~cond := #in~cond; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {12980#(<= ~counter~0 3)} assume !(0 == ~cond); {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {12980#(<= ~counter~0 3)} assume true; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,404 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12980#(<= ~counter~0 3)} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,405 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {13005#(<= ~counter~0 4)} ~cond := #in~cond; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {13005#(<= ~counter~0 4)} assume !(0 == ~cond); {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {13005#(<= ~counter~0 4)} assume true; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,406 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13005#(<= ~counter~0 4)} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,408 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {13030#(<= ~counter~0 5)} ~cond := #in~cond; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,408 INFO L290 TraceCheckUtils]: 48: Hoare triple {13030#(<= ~counter~0 5)} assume !(0 == ~cond); {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,408 INFO L290 TraceCheckUtils]: 49: Hoare triple {13030#(<= ~counter~0 5)} assume true; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,409 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13030#(<= ~counter~0 5)} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,410 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {13055#(<= ~counter~0 6)} ~cond := #in~cond; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,411 INFO L290 TraceCheckUtils]: 56: Hoare triple {13055#(<= ~counter~0 6)} assume !(0 == ~cond); {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {13055#(<= ~counter~0 6)} assume true; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,411 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13055#(<= ~counter~0 6)} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,412 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,412 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,413 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,413 INFO L290 TraceCheckUtils]: 63: Hoare triple {13080#(<= ~counter~0 7)} ~cond := #in~cond; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {13080#(<= ~counter~0 7)} assume !(0 == ~cond); {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {13080#(<= ~counter~0 7)} assume true; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,414 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13080#(<= ~counter~0 7)} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,414 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,415 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,415 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {13105#(<= ~counter~0 8)} ~cond := #in~cond; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {13105#(<= ~counter~0 8)} assume !(0 == ~cond); {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {13105#(<= ~counter~0 8)} assume true; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,417 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13105#(<= ~counter~0 8)} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,417 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,418 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,418 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {13130#(<= ~counter~0 9)} ~cond := #in~cond; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,419 INFO L290 TraceCheckUtils]: 80: Hoare triple {13130#(<= ~counter~0 9)} assume !(0 == ~cond); {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,419 INFO L290 TraceCheckUtils]: 81: Hoare triple {13130#(<= ~counter~0 9)} assume true; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,419 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13130#(<= ~counter~0 9)} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,420 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,420 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-15 11:03:05,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-15 11:03:05,420 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12889#false} is VALID [2022-04-15 11:03:05,420 INFO L290 TraceCheckUtils]: 87: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-15 11:03:05,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {12889#false} assume !(0 == ~cond); {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L290 TraceCheckUtils]: 89: Hoare triple {12889#false} assume true; {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12889#false} {12889#false} #57#return; {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-15 11:03:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:03:05,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:03:05,797 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-15 11:03:05,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-15 11:03:05,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-15 11:03:05,798 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-15 11:03:05,798 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12888#true} {12889#false} #57#return; {12889#false} is VALID [2022-04-15 11:03:05,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,798 INFO L290 TraceCheckUtils]: 87: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,798 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-15 11:03:05,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-15 11:03:05,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,799 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12888#true} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,800 INFO L290 TraceCheckUtils]: 81: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,800 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,800 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-15 11:03:05,801 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,801 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12888#true} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,801 INFO L290 TraceCheckUtils]: 73: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,802 INFO L290 TraceCheckUtils]: 72: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,802 INFO L290 TraceCheckUtils]: 71: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,802 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-15 11:03:05,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,803 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12888#true} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,803 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,804 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-15 11:03:05,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,805 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12888#true} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,805 INFO L290 TraceCheckUtils]: 55: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,805 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-15 11:03:05,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,806 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12888#true} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,807 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-15 11:03:05,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,808 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12888#true} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,808 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-15 11:03:05,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,810 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12888#true} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,810 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-15 11:03:05,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,812 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12888#true} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,812 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-15 11:03:05,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,813 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12888#true} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,814 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-15 11:03:05,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12888#true} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-15 11:03:05,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-15 11:03:05,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-15 11:03:05,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12888#true} is VALID [2022-04-15 11:03:05,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-15 11:03:05,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-15 11:03:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 11:03:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:03:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037064041] [2022-04-15 11:03:05,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:03:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579288558] [2022-04-15 11:03:05,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579288558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:03:05,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:03:05,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-15 11:03:05,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:03:05,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144171389] [2022-04-15 11:03:05,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144171389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:03:05,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:03:05,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:03:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911076762] [2022-04-15 11:03:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:03:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-15 11:03:05,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:03:05,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:03:05,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:05,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:03:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:03:05,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-15 11:03:05,909 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:03:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:06,281 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-15 11:03:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 11:03:06,281 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-15 11:03:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:03:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:03:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-15 11:03:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:03:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-15 11:03:06,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-15 11:03:06,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:06,367 INFO L225 Difference]: With dead ends: 110 [2022-04-15 11:03:06,367 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 11:03:06,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-15 11:03:06,368 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:03:06,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 126 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:03:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 11:03:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 11:03:06,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:03:06,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:06,482 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:06,482 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:06,483 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-15 11:03:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 11:03:06,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:06,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:06,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-15 11:03:06,484 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-15 11:03:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:03:06,485 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-15 11:03:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 11:03:06,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:03:06,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:03:06,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:03:06,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:03:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 11:03:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-15 11:03:06,487 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-15 11:03:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:03:06,487 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-15 11:03:06,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 11:03:06,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-15 11:03:10,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 101 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:03:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-15 11:03:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 11:03:10,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:03:10,788 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:03:10,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 11:03:11,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 11:03:11,003 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:03:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:03:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-15 11:03:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:03:11,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147757341] [2022-04-15 11:03:11,087 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:03:11,087 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:03:11,087 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:03:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-15 11:03:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:03:11,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776398596] [2022-04-15 11:03:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:03:11,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:03:11,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:03:11,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715968565] [2022-04-15 11:03:11,101 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:03:11,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:03:11,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:03:11,102 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:03:11,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 11:04:46,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 11:04:46,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 11:04:46,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 11:04:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:04:46,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:04:46,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {14108#true} call ULTIMATE.init(); {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {14108#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14108#true} {14108#true} #61#return; {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {14108#true} call #t~ret6 := main(); {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {14108#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {14108#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14108#true} {14108#true} #53#return; {14108#true} is VALID [2022-04-15 11:04:46,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {14108#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:04:46,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:04:46,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:04:46,774 INFO L272 TraceCheckUtils]: 14: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,774 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14108#true} {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 11:04:46,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:04:46,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:04:46,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:04:46,775 INFO L272 TraceCheckUtils]: 22: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,776 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14108#true} {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 11:04:46,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:04:46,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:04:46,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:04:46,777 INFO L272 TraceCheckUtils]: 30: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,778 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14108#true} {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 11:04:46,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 11:04:46,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 11:04:46,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 11:04:46,780 INFO L272 TraceCheckUtils]: 38: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,780 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14108#true} {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 11:04:46,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:04:46,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:04:46,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:04:46,782 INFO L272 TraceCheckUtils]: 46: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,782 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14108#true} {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 11:04:46,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 11:04:46,783 INFO L290 TraceCheckUtils]: 52: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 11:04:46,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 11:04:46,783 INFO L272 TraceCheckUtils]: 54: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,784 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14108#true} {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 11:04:46,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 11:04:46,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 11:04:46,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 11:04:46,785 INFO L272 TraceCheckUtils]: 62: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,786 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14108#true} {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 11:04:46,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:04:46,787 INFO L290 TraceCheckUtils]: 68: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:04:46,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:04:46,787 INFO L272 TraceCheckUtils]: 70: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,788 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14108#true} {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 11:04:46,788 INFO L290 TraceCheckUtils]: 75: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-15 11:04:46,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-15 11:04:46,789 INFO L290 TraceCheckUtils]: 77: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-15 11:04:46,789 INFO L272 TraceCheckUtils]: 78: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,789 INFO L290 TraceCheckUtils]: 81: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,789 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14108#true} {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-15 11:04:46,790 INFO L290 TraceCheckUtils]: 83: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 11:04:46,790 INFO L290 TraceCheckUtils]: 84: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 11:04:46,790 INFO L290 TraceCheckUtils]: 85: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 10);havoc #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 11:04:46,791 INFO L272 TraceCheckUtils]: 86: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,791 INFO L290 TraceCheckUtils]: 87: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,791 INFO L290 TraceCheckUtils]: 89: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,791 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14108#true} {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 11:04:46,792 INFO L290 TraceCheckUtils]: 91: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-15 11:04:46,792 INFO L272 TraceCheckUtils]: 92: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-15 11:04:46,792 INFO L290 TraceCheckUtils]: 93: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-15 11:04:46,792 INFO L290 TraceCheckUtils]: 94: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-15 11:04:46,792 INFO L290 TraceCheckUtils]: 95: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-15 11:04:46,792 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14108#true} {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-15 11:04:46,793 INFO L272 TraceCheckUtils]: 97: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 11:04:46,793 INFO L290 TraceCheckUtils]: 98: Hoare triple {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 11:04:46,793 INFO L290 TraceCheckUtils]: 99: Hoare triple {14419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14109#false} is VALID [2022-04-15 11:04:46,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {14109#false} assume !false; {14109#false} is VALID [2022-04-15 11:04:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 11:04:46,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:04:47,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:04:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776398596] [2022-04-15 11:04:47,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 11:04:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715968565] [2022-04-15 11:04:47,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715968565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:04:47,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 11:04:47,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-15 11:04:47,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:04:47,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147757341] [2022-04-15 11:04:47,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147757341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:04:47,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:04:47,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 11:04:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161148534] [2022-04-15 11:04:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:04:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-15 11:04:47,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:04:47,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 11:04:47,791 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-15 11:04:47,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 11:04:47,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:04:47,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 11:04:47,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-15 11:04:47,793 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 11:04:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:04:49,026 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-15 11:04:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 11:04:49,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-15 11:04:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:04:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 11:04:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-15 11:04:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 11:04:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-15 11:04:49,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-15 11:04:49,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:04:49,094 INFO L225 Difference]: With dead ends: 108 [2022-04-15 11:04:49,094 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 11:04:49,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:04:49,095 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:04:49,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 11:04:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 11:04:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-15 11:04:49,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:04:49,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 11:04:49,235 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 11:04:49,235 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 11:04:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:04:49,236 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-15 11:04:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 11:04:49,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:04:49,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:04:49,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-15 11:04:49,237 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-15 11:04:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:04:49,238 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-15 11:04:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 11:04:49,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:04:49,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:04:49,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:04:49,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:04:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 11:04:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-15 11:04:49,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-15 11:04:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:04:49,242 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-15 11:04:49,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 11:04:49,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-15 11:04:53,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:04:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 11:04:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 11:04:53,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:04:53,460 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:04:53,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 11:04:53,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 11:04:53,660 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:04:53,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:04:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-15 11:04:53,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:04:53,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837668183] [2022-04-15 11:04:53,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:04:53,758 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 11:04:53,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:04:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-15 11:04:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:04:53,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508118202] [2022-04-15 11:04:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:04:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:04:53,779 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 11:04:53,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [428960450] [2022-04-15 11:04:53,779 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 11:04:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:04:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:04:53,780 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 11:04:53,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 11:04:54,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-15 11:04:54,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 11:04:54,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.