/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:11:31,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:11:31,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:11:31,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:11:31,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:11:31,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:11:31,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:11:31,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:11:31,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:11:31,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:11:31,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:11:31,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:11:31,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:11:31,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:11:31,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:11:31,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:11:31,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:11:31,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:11:31,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:11:31,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:11:31,511 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:11:31,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:11:31,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:11:31,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:11:31,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:11:31,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:11:31,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:11:31,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:11:31,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:11:31,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:11:31,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:11:31,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:11:31,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:11:31,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:11:31,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:11:31,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:11:31,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:11:31,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:11:31,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:11:31,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:11:31,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:11:31,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:11:31,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:11:31,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:11:31,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:11:31,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:11:31,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:11:31,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:11:31,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:11:31,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:11:31,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:11:31,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:11:31,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:11:31,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:11:31,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:11:31,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:11:31,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:11:31,534 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:11:31,534 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 17:11:31,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:11:31,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:11:31,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:11:31,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:11:31,699 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:11:31,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c [2022-04-15 17:11:31,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d5068ce8/d5dd0afa3c204aab872c632a7904dbe1/FLAGfdc510ae5 [2022-04-15 17:11:32,088 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:11:32,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c [2022-04-15 17:11:32,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d5068ce8/d5dd0afa3c204aab872c632a7904dbe1/FLAGfdc510ae5 [2022-04-15 17:11:32,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d5068ce8/d5dd0afa3c204aab872c632a7904dbe1 [2022-04-15 17:11:32,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:11:32,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:11:32,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:11:32,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:11:32,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:11:32,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3df0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32, skipping insertion in model container [2022-04-15 17:11:32,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:11:32,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:11:32,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c[458,471] [2022-04-15 17:11:32,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:11:32,313 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:11:32,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound100.c[458,471] [2022-04-15 17:11:32,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:11:32,348 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:11:32,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32 WrapperNode [2022-04-15 17:11:32,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:11:32,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:11:32,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:11:32,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:11:32,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:11:32,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:11:32,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:11:32,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:11:32,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (1/1) ... [2022-04-15 17:11:32,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:11:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:32,403 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 17:11:32,419 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 17:11:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:11:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:11:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:11:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 17:11:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 17:11:32,435 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:11:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:11:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:11:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:11:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:11:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 17:11:32,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 17:11:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 17:11:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:11:32,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:11:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:11:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:11:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:11:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:11:32,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:11:32,481 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:11:32,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:11:32,627 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:11:32,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:11:32,631 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:11:32,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:11:32 BoogieIcfgContainer [2022-04-15 17:11:32,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:11:32,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:11:32,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:11:32,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:11:32,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:11:32" (1/3) ... [2022-04-15 17:11:32,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bae8c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:11:32, skipping insertion in model container [2022-04-15 17:11:32,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:11:32" (2/3) ... [2022-04-15 17:11:32,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bae8c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:11:32, skipping insertion in model container [2022-04-15 17:11:32,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:11:32" (3/3) ... [2022-04-15 17:11:32,637 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound100.c [2022-04-15 17:11:32,640 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:11:32,640 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:11:32,665 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:11:32,669 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 17:11:32,669 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:11:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:11:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:11:32,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:32,685 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:32,685 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:32,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-15 17:11:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:32,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583965787] [2022-04-15 17:11:32,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:32,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-15 17:11:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:32,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673976105] [2022-04-15 17:11:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:32,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:11:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:32,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 17:11:32,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 17:11:32,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-15 17:11:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:11:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:32,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:11:32,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:11:32,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:11:32,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 17:11:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 17:11:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:32,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:11:32,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:11:32,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:11:32,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 17:11:32,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:11:32,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 17:11:32,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 17:11:32,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-15 17:11:32,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-15 17:11:32,838 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 17:11:32,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {32#true} is VALID [2022-04-15 17:11:32,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:11:32,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:11:32,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:11:32,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 17:11:32,839 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-15 17:11:32,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 17:11:32,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 17:11:32,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 17:11:32,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 17:11:32,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-15 17:11:32,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-15 17:11:32,840 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-15 17:11:32,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 17:11:32,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 17:11:32,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 17:11:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:11:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:32,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673976105] [2022-04-15 17:11:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673976105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:32,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:32,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:11:32,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:32,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583965787] [2022-04-15 17:11:32,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583965787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:32,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:32,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:11:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391113390] [2022-04-15 17:11:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:32,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 17:11:32,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:32,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:11:32,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:32,869 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 17:11:32,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 17:11:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 17:11:32,883 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:11:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:33,025 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-15 17:11:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 17:11:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 17:11:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:11:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-15 17:11:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:11:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-15 17:11:33,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-15 17:11:33,132 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 17:11:33,138 INFO L225 Difference]: With dead ends: 51 [2022-04-15 17:11:33,138 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 17:11:33,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 17:11:33,142 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:33,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:11:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 17:11:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 17:11:33,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:33,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:11:33,163 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:11:33,164 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:11:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:33,167 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 17:11:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 17:11:33,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:33,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:33,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-15 17:11:33,168 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-15 17:11:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:33,172 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 17:11:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 17:11:33,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:33,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:33,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:33,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 17:11:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 17:11:33,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-15 17:11:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:33,176 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 17:11:33,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 17:11:33,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 17:11:33,203 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 17:11:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 17:11:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:11:33,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:33,205 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:33,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:11:33,205 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:33,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-15 17:11:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:33,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600497741] [2022-04-15 17:11:33,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:33,207 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-15 17:11:33,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:33,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072386783] [2022-04-15 17:11:33,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:33,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:33,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986433556] [2022-04-15 17:11:33,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:11:33,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:33,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:33,224 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 17:11:33,225 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 17:11:33,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 17:11:33,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:33,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 17:11:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:33,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:33,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-15 17:11:33,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-15 17:11:33,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 17:11:33,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-15 17:11:33,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-15 17:11:33,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-15 17:11:33,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {246#true} is VALID [2022-04-15 17:11:33,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 17:11:33,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 17:11:33,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 17:11:33,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-15 17:11:33,452 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-15 17:11:33,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 17:11:33,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 17:11:33,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 17:11:33,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-15 17:11:33,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:33,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:33,458 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:33,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:33,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-15 17:11:33,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-15 17:11:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:11:33,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:11:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:33,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072386783] [2022-04-15 17:11:33,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:33,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986433556] [2022-04-15 17:11:33,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986433556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:33,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:33,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:11:33,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600497741] [2022-04-15 17:11:33,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600497741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:33,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:33,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:11:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925842523] [2022-04-15 17:11:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:33,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 17:11:33,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:33,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:11:33,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:33,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:11:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:11:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:11:33,480 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:11:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:33,604 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 17:11:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:11:33,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 17:11:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:11:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 17:11:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:11:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 17:11:33,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 17:11:33,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:33,640 INFO L225 Difference]: With dead ends: 35 [2022-04-15 17:11:33,640 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 17:11:33,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:11:33,643 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:33,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:11:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 17:11:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 17:11:33,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:33,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:33,657 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:33,658 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:33,659 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 17:11:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 17:11:33,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:33,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:33,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-15 17:11:33,661 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-15 17:11:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:33,662 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-15 17:11:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 17:11:33,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:33,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:33,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:33,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 17:11:33,665 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-15 17:11:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:33,665 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 17:11:33,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:11:33,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 17:11:33,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 17:11:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 17:11:33,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:33,700 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:33,725 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 17:11:33,911 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 17:11:33,911 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-15 17:11:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678437953] [2022-04-15 17:11:33,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-15 17:11:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102417987] [2022-04-15 17:11:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:33,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:33,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204898883] [2022-04-15 17:11:33,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:11:33,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:33,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:33,932 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 17:11:33,933 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 17:11:33,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:11:33,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:33,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 17:11:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:33,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:34,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-15 17:11:34,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-15 17:11:34,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:34,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-15 17:11:34,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-15 17:11:34,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-15 17:11:34,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {512#true} is VALID [2022-04-15 17:11:34,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:11:34,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:11:34,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:34,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-15 17:11:34,147 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-15 17:11:34,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:11:34,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:11:34,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:34,148 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-15 17:11:34,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:34,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:34,149 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-15 17:11:34,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:11:34,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:11:34,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:34,150 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:34,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 17:11:34,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 17:11:34,154 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:34,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:34,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-15 17:11:34,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-15 17:11:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 17:11:34,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:11:34,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-15 17:11:34,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-15 17:11:34,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:34,327 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:34,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 17:11:36,333 WARN L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-15 17:11:36,334 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 17:11:36,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:36,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:11:36,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:11:36,335 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-15 17:11:36,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 17:11:36,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-15 17:11:36,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-15 17:11:36,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:36,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:11:36,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:11:36,344 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-15 17:11:36,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-15 17:11:36,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:36,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-15 17:11:36,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-15 17:11:36,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {512#true} is VALID [2022-04-15 17:11:36,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-15 17:11:36,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-15 17:11:36,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-15 17:11:36,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-15 17:11:36,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-15 17:11:36,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-15 17:11:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 17:11:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:36,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102417987] [2022-04-15 17:11:36,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:36,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204898883] [2022-04-15 17:11:36,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204898883] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 17:11:36,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:11:36,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 17:11:36,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:36,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678437953] [2022-04-15 17:11:36,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678437953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:36,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:36,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:11:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721373026] [2022-04-15 17:11:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:36,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 17:11:36,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:36,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:11:38,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:38,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:11:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:11:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 17:11:38,425 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:11:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:38,566 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 17:11:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:11:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 17:11:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:11:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 17:11:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:11:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 17:11:38,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 17:11:38,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:38,902 INFO L225 Difference]: With dead ends: 37 [2022-04-15 17:11:38,902 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 17:11:38,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:11:38,903 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:38,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:11:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 17:11:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 17:11:38,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:38,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:38,921 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:38,921 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:38,922 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 17:11:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 17:11:38,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:38,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:38,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-15 17:11:38,923 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-15 17:11:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:38,925 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 17:11:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 17:11:38,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:38,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:38,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:38,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 17:11:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 17:11:38,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 17:11:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:38,927 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 17:11:38,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:11:38,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 17:11:39,201 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 17:11:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 17:11:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 17:11:39,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:39,202 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:39,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 17:11:39,402 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 17:11:39,403 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-15 17:11:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:39,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380935927] [2022-04-15 17:11:39,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-15 17:11:39,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:39,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445892801] [2022-04-15 17:11:39,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:39,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:39,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [955974463] [2022-04-15 17:11:39,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:11:39,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:39,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:39,429 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 17:11:39,431 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 17:11:39,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:11:39,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:39,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 17:11:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:39,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:39,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-15 17:11:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {900#true} is VALID [2022-04-15 17:11:39,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:11:39,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-15 17:11:39,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-15 17:11:39,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {900#true} is VALID [2022-04-15 17:11:39,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {900#true} is VALID [2022-04-15 17:11:39,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:11:39,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:11:39,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:11:39,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-15 17:11:39,736 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-15 17:11:39,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:11:39,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:11:39,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:11:39,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-15 17:11:39,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:39,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:39,744 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-15 17:11:39,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:11:39,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:11:39,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:11:39,745 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:39,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 17:11:39,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 17:11:39,746 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-15 17:11:39,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:11:39,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:11:39,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:11:39,747 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 17:11:39,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 17:11:39,748 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-15 17:11:39,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-15 17:11:39,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-15 17:11:39,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-15 17:11:39,748 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 17:11:39,749 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:39,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:39,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-15 17:11:39,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-15 17:11:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 17:11:39,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:11:40,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:40,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445892801] [2022-04-15 17:11:40,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:40,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955974463] [2022-04-15 17:11:40,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955974463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:11:40,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:11:40,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 17:11:40,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:40,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380935927] [2022-04-15 17:11:40,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380935927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:40,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:40,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 17:11:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842807147] [2022-04-15 17:11:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-15 17:11:40,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:40,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:11:40,045 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 17:11:40,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 17:11:40,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 17:11:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 17:11:40,047 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:11:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:40,303 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 17:11:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 17:11:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-15 17:11:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:11:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-15 17:11:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:11:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-15 17:11:40,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-15 17:11:40,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:40,338 INFO L225 Difference]: With dead ends: 42 [2022-04-15 17:11:40,339 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 17:11:40,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:11:40,339 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:40,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:11:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 17:11:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 17:11:40,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:40,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:11:40,357 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:11:40,357 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:11:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:40,359 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 17:11:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 17:11:40,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:40,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:40,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-15 17:11:40,360 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-15 17:11:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:40,361 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 17:11:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 17:11:40,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:40,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:40,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:40,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:11:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 17:11:40,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-15 17:11:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:40,363 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 17:11:40,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 17:11:40,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-15 17:11:40,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:40,819 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 17:11:40,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 17:11:40,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:40,819 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:40,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 17:11:41,035 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 17:11:41,035 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-15 17:11:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [930978941] [2022-04-15 17:11:41,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-15 17:11:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:41,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548680651] [2022-04-15 17:11:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:41,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:41,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171692640] [2022-04-15 17:11:41,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 17:11:41,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:41,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:41,050 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 17:11:41,051 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 17:11:41,080 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 17:11:41,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:41,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 17:11:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:41,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:41,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-15 17:11:41,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-15 17:11:41,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-15 17:11:41,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-15 17:11:41,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1315#true} is VALID [2022-04-15 17:11:41,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,371 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-15 17:11:41,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:41,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:41,373 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:11:41,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:11:41,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:11:41,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,374 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:41,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 17:11:41,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 17:11:41,375 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:11:41,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:11:41,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:11:41,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,378 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 17:11:41,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-15 17:11:41,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-15 17:11:41,379 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:11:41,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:11:41,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:11:41,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,380 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-15 17:11:41,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-15 17:11:41,381 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-15 17:11:41,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-15 17:11:41,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-15 17:11:41,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 17:11:41,381 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-15 17:11:41,382 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:41,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:41,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-15 17:11:41,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-15 17:11:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 17:11:41,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:11:41,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:41,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548680651] [2022-04-15 17:11:41,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:41,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171692640] [2022-04-15 17:11:41,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171692640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:11:41,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:11:41,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 17:11:41,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:41,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [930978941] [2022-04-15 17:11:41,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [930978941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:41,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:41,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:11:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387269429] [2022-04-15 17:11:41,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-15 17:11:41,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:41,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:11:41,683 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 17:11:41,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 17:11:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 17:11:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 17:11:41,684 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:11:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:41,971 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-15 17:11:41,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:11:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-15 17:11:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:11:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 17:11:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:11:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-15 17:11:41,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-15 17:11:42,007 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 17:11:42,008 INFO L225 Difference]: With dead ends: 45 [2022-04-15 17:11:42,008 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 17:11:42,010 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 17:11:42,010 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:42,011 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:11:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 17:11:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 17:11:42,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:42,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:11:42,027 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:11:42,027 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:11:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:42,029 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 17:11:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 17:11:42,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:42,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:42,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-15 17:11:42,029 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-15 17:11:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:42,031 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 17:11:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 17:11:42,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:42,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:42,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:42,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:11:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-15 17:11:42,032 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-15 17:11:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:42,032 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-15 17:11:42,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 17:11:42,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-15 17:11:42,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 17:11:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 17:11:42,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:42,240 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:42,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 17:11:42,451 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 17:11:42,451 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-15 17:11:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:42,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705851919] [2022-04-15 17:11:42,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-15 17:11:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:42,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604663713] [2022-04-15 17:11:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:42,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:42,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823112447] [2022-04-15 17:11:42,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 17:11:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:42,474 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 17:11:42,475 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 17:11:43,078 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 17:11:43,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:43,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 17:11:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:43,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:43,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID [2022-04-15 17:11:43,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,445 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID [2022-04-15 17:11:43,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:43,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:43,446 INFO L272 TraceCheckUtils]: 18: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,446 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1823#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:43,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 17:11:43,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 17:11:43,447 INFO L272 TraceCheckUtils]: 25: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,448 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 17:11:43,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:11:43,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:11:43,449 INFO L272 TraceCheckUtils]: 32: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,449 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,449 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:11:43,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 17:11:43,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 17:11:43,450 INFO L272 TraceCheckUtils]: 39: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,451 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 17:11:43,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 17:11:43,452 INFO L272 TraceCheckUtils]: 45: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-15 17:11:43,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-15 17:11:43,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-15 17:11:43,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-15 17:11:43,453 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-15 17:11:43,453 INFO L272 TraceCheckUtils]: 50: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:43,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:43,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID [2022-04-15 17:11:43,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-15 17:11:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 17:11:43,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:11:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604663713] [2022-04-15 17:11:43,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823112447] [2022-04-15 17:11:43,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823112447] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:11:43,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:11:43,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 17:11:43,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:43,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705851919] [2022-04-15 17:11:43,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705851919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:43,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:43,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:11:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224025040] [2022-04-15 17:11:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:43,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-15 17:11:43,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:43,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 17:11:43,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:43,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 17:11:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:43,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 17:11:43,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:11:43,765 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 17:11:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:44,109 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-15 17:11:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 17:11:44,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-15 17:11:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 17:11:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 17:11:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 17:11:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 17:11:44,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 17:11:44,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:44,147 INFO L225 Difference]: With dead ends: 48 [2022-04-15 17:11:44,148 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 17:11:44,148 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 17:11:44,148 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:44,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:11:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 17:11:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 17:11:44,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:44,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:11:44,166 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:11:44,166 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:11:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:44,168 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 17:11:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 17:11:44,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:44,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:44,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-15 17:11:44,168 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-15 17:11:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:44,170 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-15 17:11:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 17:11:44,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:44,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:44,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:44,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:11:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-15 17:11:44,171 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-15 17:11:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:44,172 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-15 17:11:44,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 17:11:44,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-15 17:11:44,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 17:11:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 17:11:44,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:44,738 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:44,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 17:11:44,939 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 17:11:44,939 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-15 17:11:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:44,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516373703] [2022-04-15 17:11:44,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-15 17:11:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:44,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071127392] [2022-04-15 17:11:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:44,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:44,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038892220] [2022-04-15 17:11:44,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:11:44,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:44,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:44,958 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 17:11:44,959 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 17:11:45,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:11:45,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:45,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 17:11:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:46,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID [2022-04-15 17:11:46,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2265#true} is VALID [2022-04-15 17:11:46,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L272 TraceCheckUtils]: 11: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID [2022-04-15 17:11:46,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:46,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:46,093 INFO L272 TraceCheckUtils]: 18: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,094 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2265#true} {2318#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:46,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 17:11:46,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 17:11:46,095 INFO L272 TraceCheckUtils]: 25: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,095 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2265#true} {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 17:11:46,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:11:46,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:11:46,096 INFO L272 TraceCheckUtils]: 32: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,097 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2265#true} {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:11:46,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 17:11:46,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 17:11:46,098 INFO L272 TraceCheckUtils]: 39: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,098 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2265#true} {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 17:11:46,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 17:11:46,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 17:11:46,099 INFO L272 TraceCheckUtils]: 46: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,105 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2265#true} {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 17:11:46,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 17:11:46,105 INFO L272 TraceCheckUtils]: 52: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-15 17:11:46,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-15 17:11:46,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-15 17:11:46,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-15 17:11:46,106 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2265#true} {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 17:11:46,107 INFO L272 TraceCheckUtils]: 57: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:46,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:46,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID [2022-04-15 17:11:46,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID [2022-04-15 17:11:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 17:11:46,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:11:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071127392] [2022-04-15 17:11:46,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038892220] [2022-04-15 17:11:46,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038892220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:11:46,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:11:46,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 17:11:46,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516373703] [2022-04-15 17:11:46,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516373703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:46,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:46,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 17:11:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417807740] [2022-04-15 17:11:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-15 17:11:46,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:46,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-15 17:11:46,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:46,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 17:11:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:46,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 17:11:46,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 17:11:46,401 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-15 17:11:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:46,858 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-15 17:11:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 17:11:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-15 17:11:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-15 17:11:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 17:11:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-15 17:11:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-15 17:11:46,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-15 17:11:46,901 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 17:11:46,902 INFO L225 Difference]: With dead ends: 51 [2022-04-15 17:11:46,902 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 17:11:46,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 17:11:46,902 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:46,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:11:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 17:11:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 17:11:46,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:46,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:11:46,929 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:11:46,929 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:11:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:46,932 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 17:11:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 17:11:46,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:46,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:46,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-15 17:11:46,933 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-15 17:11:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:46,936 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 17:11:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 17:11:46,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:46,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:46,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:46,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:11:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-15 17:11:46,940 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-15 17:11:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:46,940 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-15 17:11:46,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-15 17:11:46,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-15 17:11:48,182 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 17:11:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 17:11:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 17:11:48,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:48,183 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:48,189 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 17:11:48,389 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 17:11:48,389 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-15 17:11:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:48,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796092142] [2022-04-15 17:11:48,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-15 17:11:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:48,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772319483] [2022-04-15 17:11:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:48,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:48,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148691960] [2022-04-15 17:11:48,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 17:11:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:48,400 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 17:11:48,401 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 17:11:48,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 17:11:48,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:11:48,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 17:11:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:11:48,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:11:48,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {2800#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID [2022-04-15 17:11:48,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,805 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID [2022-04-15 17:11:48,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:48,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:48,809 INFO L272 TraceCheckUtils]: 18: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,814 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2800#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:11:48,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 17:11:48,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 17:11:48,815 INFO L272 TraceCheckUtils]: 25: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,816 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2800#true} {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 17:11:48,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 17:11:48,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 17:11:48,816 INFO L272 TraceCheckUtils]: 32: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,817 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2800#true} {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 17:11:48,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 17:11:48,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 17:11:48,818 INFO L272 TraceCheckUtils]: 39: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,819 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2800#true} {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 17:11:48,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:11:48,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:11:48,820 INFO L272 TraceCheckUtils]: 46: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,820 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2800#true} {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:11:48,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 17:11:48,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 17:11:48,821 INFO L272 TraceCheckUtils]: 53: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,822 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,823 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2800#true} {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 17:11:48,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 17:11:48,827 INFO L272 TraceCheckUtils]: 59: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-15 17:11:48,827 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-15 17:11:48,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-15 17:11:48,827 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-15 17:11:48,828 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2800#true} {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-15 17:11:48,828 INFO L272 TraceCheckUtils]: 64: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:11:48,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:11:48,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID [2022-04-15 17:11:48,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID [2022-04-15 17:11:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 17:11:48,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:11:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:11:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772319483] [2022-04-15 17:11:49,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:11:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148691960] [2022-04-15 17:11:49,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148691960] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:11:49,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:11:49,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 17:11:49,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:11:49,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796092142] [2022-04-15 17:11:49,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796092142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:11:49,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:11:49,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:11:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146659765] [2022-04-15 17:11:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:11:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-15 17:11:49,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:11:49,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:11:49,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:49,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 17:11:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 17:11:49,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 17:11:49,129 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:11:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:49,635 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 17:11:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 17:11:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-15 17:11:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:11:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:11:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 17:11:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:11:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-15 17:11:49,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-15 17:11:49,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:49,676 INFO L225 Difference]: With dead ends: 54 [2022-04-15 17:11:49,676 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 17:11:49,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 17:11:49,677 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:11:49,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:11:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 17:11:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 17:11:49,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:11:49,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:11:49,702 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:11:49,702 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:11:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:49,703 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 17:11:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-15 17:11:49,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:49,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:49,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-15 17:11:49,704 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-15 17:11:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:11:49,705 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 17:11:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-15 17:11:49,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:11:49,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:11:49,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:11:49,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:11:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:11:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-15 17:11:49,707 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-15 17:11:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:11:49,707 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-15 17:11:49,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:11:49,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-15 17:11:50,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:11:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-15 17:11:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 17:11:50,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:11:50,359 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:11:50,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 17:11:50,567 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 17:11:50,567 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:11:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:11:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-15 17:11:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:11:50,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546667856] [2022-04-15 17:11:50,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:11:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-15 17:11:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:11:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491433494] [2022-04-15 17:11:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:11:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:11:50,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:11:50,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559479813] [2022-04-15 17:11:50,581 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 17:11:50,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:11:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:11:50,588 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 17:11:50,588 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 17:12:01,961 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 17:12:01,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:12:01,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 17:12:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:12:01,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:12:02,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2022-04-15 17:12:02,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3375#true} is VALID [2022-04-15 17:12:02,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID [2022-04-15 17:12:02,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:02,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:02,462 INFO L272 TraceCheckUtils]: 18: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,463 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3375#true} {3428#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:02,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:02,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:02,464 INFO L272 TraceCheckUtils]: 25: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,464 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3375#true} {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:02,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 17:12:02,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 17:12:02,465 INFO L272 TraceCheckUtils]: 32: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,466 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3375#true} {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 17:12:02,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 17:12:02,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 17:12:02,467 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,468 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 17:12:02,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:02,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:02,469 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,469 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:02,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:02,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:02,470 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,471 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3375#true} {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:02,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#(and (< 1 main_~k~0) (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 17:12:02,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 17:12:02,472 INFO L272 TraceCheckUtils]: 60: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,472 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 17:12:02,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 17:12:02,473 INFO L272 TraceCheckUtils]: 66: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-15 17:12:02,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-15 17:12:02,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-15 17:12:02,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-15 17:12:02,474 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3375#true} {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 17:12:02,474 INFO L272 TraceCheckUtils]: 71: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:12:02,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:12:02,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID [2022-04-15 17:12:02,475 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2022-04-15 17:12:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 17:12:02,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:12:03,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:12:03,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491433494] [2022-04-15 17:12:03,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:12:03,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559479813] [2022-04-15 17:12:03,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559479813] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:12:03,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:12:03,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 17:12:03,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:12:03,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546667856] [2022-04-15 17:12:03,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546667856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:12:03,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:12:03,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:12:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80131814] [2022-04-15 17:12:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:12:03,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-15 17:12:03,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:12:03,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-15 17:12:03,075 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 17:12:03,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:12:03,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:12:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 17:12:03,076 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-15 17:12:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:03,779 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-15 17:12:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 17:12:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-15 17:12:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:12:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-15 17:12:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-15 17:12:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-15 17:12:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-15 17:12:03,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-15 17:12:03,827 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 17:12:03,828 INFO L225 Difference]: With dead ends: 57 [2022-04-15 17:12:03,828 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 17:12:03,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-15 17:12:03,829 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 17:12:03,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 17:12:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 17:12:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 17:12:03,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:12:03,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:12:03,864 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:12:03,865 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:12:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:03,866 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 17:12:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 17:12:03,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:03,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:03,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-15 17:12:03,867 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-15 17:12:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:03,868 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 17:12:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 17:12:03,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:03,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:03,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:12:03,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:12:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:12:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-15 17:12:03,870 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-15 17:12:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:12:03,870 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-15 17:12:03,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-15 17:12:03,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-15 17:12:04,256 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 17:12:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 17:12:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 17:12:04,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:12:04,257 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:12:04,264 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 17:12:04,463 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 17:12:04,463 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:12:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:12:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-15 17:12:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:04,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [968152722] [2022-04-15 17:12:04,464 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:12:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-15 17:12:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:12:04,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524994279] [2022-04-15 17:12:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:12:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:12:04,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:12:04,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020847336] [2022-04-15 17:12:04,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:12:04,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:12:04,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:12:04,489 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 17:12:04,490 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 17:12:12,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:12:12,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:12:12,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 17:12:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:12:12,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:12:12,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {4078#true} call ULTIMATE.init(); {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {4078#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4078#true} {4078#true} #63#return; {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {4078#true} call #t~ret5 := main(); {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {4078#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {4078#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4078#true} {4078#true} #53#return; {4078#true} is VALID [2022-04-15 17:12:12,562 INFO L272 TraceCheckUtils]: 11: Hoare triple {4078#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,562 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4078#true} {4078#true} #55#return; {4078#true} is VALID [2022-04-15 17:12:12,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {4078#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4131#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:12,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {4131#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4131#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:12,563 INFO L272 TraceCheckUtils]: 18: Hoare triple {4131#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,564 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4078#true} {4131#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4131#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:12,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {4131#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4153#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 17:12:12,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {4153#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4153#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 17:12:12,565 INFO L272 TraceCheckUtils]: 25: Hoare triple {4153#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,566 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4078#true} {4153#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {4153#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 17:12:12,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {4153#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 17:12:12,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 17:12:12,566 INFO L272 TraceCheckUtils]: 32: Hoare triple {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,567 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4078#true} {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 17:12:12,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {4175#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 17:12:12,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !false; {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 17:12:12,568 INFO L272 TraceCheckUtils]: 39: Hoare triple {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,569 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4078#true} {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} #57#return; {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 17:12:12,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {4197#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:12,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:12,572 INFO L272 TraceCheckUtils]: 46: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,574 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4078#true} {4219#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4219#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:12,574 INFO L290 TraceCheckUtils]: 51: Hoare triple {4219#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 17:12:12,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 17:12:12,575 INFO L272 TraceCheckUtils]: 53: Hoare triple {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,575 INFO L290 TraceCheckUtils]: 55: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,575 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4078#true} {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #57#return; {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 17:12:12,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {4241#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 17:12:12,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !false; {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 17:12:12,576 INFO L272 TraceCheckUtils]: 60: Hoare triple {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,576 INFO L290 TraceCheckUtils]: 61: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,576 INFO L290 TraceCheckUtils]: 62: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,577 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4078#true} {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #57#return; {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 17:12:12,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {4263#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 17:12:12,578 INFO L290 TraceCheckUtils]: 66: Hoare triple {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 17:12:12,578 INFO L272 TraceCheckUtils]: 67: Hoare triple {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,578 INFO L290 TraceCheckUtils]: 68: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,578 INFO L290 TraceCheckUtils]: 69: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,578 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4078#true} {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 17:12:12,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {4285#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 17:12:12,579 INFO L272 TraceCheckUtils]: 73: Hoare triple {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4078#true} is VALID [2022-04-15 17:12:12,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {4078#true} ~cond := #in~cond; {4078#true} is VALID [2022-04-15 17:12:12,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {4078#true} assume !(0 == ~cond); {4078#true} is VALID [2022-04-15 17:12:12,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {4078#true} assume true; {4078#true} is VALID [2022-04-15 17:12:12,580 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4078#true} {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 17:12:12,580 INFO L272 TraceCheckUtils]: 78: Hoare triple {4307#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:12:12,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {4326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:12:12,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {4330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4079#false} is VALID [2022-04-15 17:12:12,581 INFO L290 TraceCheckUtils]: 81: Hoare triple {4079#false} assume !false; {4079#false} is VALID [2022-04-15 17:12:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 17:12:12,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:12:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:12:12,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524994279] [2022-04-15 17:12:12,878 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:12:12,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020847336] [2022-04-15 17:12:12,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020847336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:12:12,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:12:12,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 17:12:12,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:12:12,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [968152722] [2022-04-15 17:12:12,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [968152722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:12:12,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:12:12,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 17:12:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6033757] [2022-04-15 17:12:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:12:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-15 17:12:12,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:12:12,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-15 17:12:12,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:12:12,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 17:12:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:12,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 17:12:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-15 17:12:12,920 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-15 17:12:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:13,705 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-15 17:12:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 17:12:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-15 17:12:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:12:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-15 17:12:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-15 17:12:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-15 17:12:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-15 17:12:13,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-15 17:12:13,764 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 17:12:13,765 INFO L225 Difference]: With dead ends: 60 [2022-04-15 17:12:13,765 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 17:12:13,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 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 17:12:13,766 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 17:12:13,766 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 17:12:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 17:12:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 17:12:13,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:12:13,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 17:12:13,804 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 17:12:13,804 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 17:12:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:13,806 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-15 17:12:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 17:12:13,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:13,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:13,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-15 17:12:13,807 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-15 17:12:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:13,808 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-15 17:12:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 17:12:13,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:13,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:13,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:12:13,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:12:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 17:12:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-15 17:12:13,811 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-15 17:12:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:12:13,811 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-15 17:12:13,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-15 17:12:13,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-15 17:12:14,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:12:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 17:12:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 17:12:14,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:12:14,168 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:12:14,175 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 17:12:14,368 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 17:12:14,368 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:12:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:12:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-15 17:12:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:14,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [894512584] [2022-04-15 17:12:14,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:12:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-15 17:12:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:12:14,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038299474] [2022-04-15 17:12:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:12:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:12:14,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:12:14,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775583746] [2022-04-15 17:12:14,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 17:12:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:12:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:12:14,382 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 17:12:14,389 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 17:12:14,422 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 17:12:14,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:12:14,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 17:12:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:12:14,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:12:14,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #63#return; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret5 := main(); {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {4733#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4733#true} {4733#true} #53#return; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L272 TraceCheckUtils]: 11: Hoare triple {4733#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,906 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4733#true} {4733#true} #55#return; {4733#true} is VALID [2022-04-15 17:12:14,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {4733#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4786#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:14,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {4786#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4786#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:14,906 INFO L272 TraceCheckUtils]: 18: Hoare triple {4786#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,907 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4733#true} {4786#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4786#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:14,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {4786#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:14,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:14,908 INFO L272 TraceCheckUtils]: 25: Hoare triple {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,909 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4733#true} {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:14,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {4808#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 17:12:14,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 17:12:14,909 INFO L272 TraceCheckUtils]: 32: Hoare triple {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,910 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4733#true} {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-15 17:12:14,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {4830#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-15 17:12:14,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-15 17:12:14,912 INFO L272 TraceCheckUtils]: 39: Hoare triple {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,912 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4733#true} {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-15 17:12:14,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {4852#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4874#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:14,913 INFO L290 TraceCheckUtils]: 45: Hoare triple {4874#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4874#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:14,913 INFO L272 TraceCheckUtils]: 46: Hoare triple {4874#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,913 INFO L290 TraceCheckUtils]: 47: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,914 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4733#true} {4874#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4874#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 17:12:14,914 INFO L290 TraceCheckUtils]: 51: Hoare triple {4874#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:14,915 INFO L290 TraceCheckUtils]: 52: Hoare triple {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:14,915 INFO L272 TraceCheckUtils]: 53: Hoare triple {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,915 INFO L290 TraceCheckUtils]: 54: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,915 INFO L290 TraceCheckUtils]: 55: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,915 INFO L290 TraceCheckUtils]: 56: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,915 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4733#true} {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:14,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {4896#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:12:14,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:12:14,916 INFO L272 TraceCheckUtils]: 60: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,917 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4733#true} {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:12:14,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {4918#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:12:14,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:12:14,918 INFO L272 TraceCheckUtils]: 67: Hoare triple {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,918 INFO L290 TraceCheckUtils]: 68: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,918 INFO L290 TraceCheckUtils]: 69: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,918 INFO L290 TraceCheckUtils]: 70: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,918 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4733#true} {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:12:14,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {4940#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-15 17:12:14,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !false; {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-15 17:12:14,919 INFO L272 TraceCheckUtils]: 74: Hoare triple {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,920 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4733#true} {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #57#return; {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-15 17:12:14,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {4962#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-15 17:12:14,920 INFO L272 TraceCheckUtils]: 80: Hoare triple {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 17:12:14,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 17:12:14,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 17:12:14,921 INFO L290 TraceCheckUtils]: 83: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 17:12:14,921 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4733#true} {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #59#return; {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-15 17:12:14,922 INFO L272 TraceCheckUtils]: 85: Hoare triple {4984#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:12:14,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {5003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:12:14,922 INFO L290 TraceCheckUtils]: 87: Hoare triple {5007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-15 17:12:14,922 INFO L290 TraceCheckUtils]: 88: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-15 17:12:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 17:12:14,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:12:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:12:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038299474] [2022-04-15 17:12:15,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:12:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775583746] [2022-04-15 17:12:15,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775583746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:12:15,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:12:15,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 17:12:15,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:12:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [894512584] [2022-04-15 17:12:15,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [894512584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:12:15,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:12:15,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 17:12:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729452198] [2022-04-15 17:12:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:12:15,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-15 17:12:15,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:12:15,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-15 17:12:15,211 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 17:12:15,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 17:12:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:15,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 17:12:15,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 17:12:15,212 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-15 17:12:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:16,081 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-15 17:12:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 17:12:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-15 17:12:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:12:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-15 17:12:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 17:12:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-15 17:12:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-15 17:12:16,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-15 17:12:16,142 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 17:12:16,142 INFO L225 Difference]: With dead ends: 63 [2022-04-15 17:12:16,143 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 17:12:16,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-15 17:12:16,143 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 17:12:16,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 17:12:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 17:12:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 17:12:16,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:12:16,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 17:12:16,180 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 17:12:16,180 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 17:12:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:16,182 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 17:12:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 17:12:16,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:16,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:16,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-15 17:12:16,182 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-15 17:12:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:16,183 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-15 17:12:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 17:12:16,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:16,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:16,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:12:16,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:12:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 17:12:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-15 17:12:16,185 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-15 17:12:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:12:16,185 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-15 17:12:16,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-15 17:12:16,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-15 17:12:16,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:12:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-15 17:12:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 17:12:16,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:12:16,755 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:12:16,771 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 17:12:16,959 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 17:12:16,960 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:12:16,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:12:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-15 17:12:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:16,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052368074] [2022-04-15 17:12:16,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:12:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-15 17:12:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:12:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788171475] [2022-04-15 17:12:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:12:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:12:16,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:12:16,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634354493] [2022-04-15 17:12:16,984 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 17:12:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:12:16,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:12:16,985 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 17:12:16,986 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 17:12:49,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 17:12:49,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:12:49,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 17:12:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:12:49,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:12:49,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5428#true} is VALID [2022-04-15 17:12:49,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {5428#true} is VALID [2022-04-15 17:12:49,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #63#return; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {5428#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5428#true} {5428#true} #53#return; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L272 TraceCheckUtils]: 11: Hoare triple {5428#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,773 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5428#true} {5428#true} #55#return; {5428#true} is VALID [2022-04-15 17:12:49,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {5428#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5481#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:49,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {5481#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5481#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:49,780 INFO L272 TraceCheckUtils]: 18: Hoare triple {5481#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,781 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5428#true} {5481#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5481#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:12:49,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {5481#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:49,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:49,782 INFO L272 TraceCheckUtils]: 25: Hoare triple {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,782 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5428#true} {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:12:49,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {5503#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5525#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 17:12:49,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {5525#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5525#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 17:12:49,783 INFO L272 TraceCheckUtils]: 32: Hoare triple {5525#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,784 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5428#true} {5525#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5525#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 17:12:49,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {5525#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 17:12:49,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 17:12:49,785 INFO L272 TraceCheckUtils]: 39: Hoare triple {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,785 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5428#true} {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 17:12:49,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {5547#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 17:12:49,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 17:12:49,786 INFO L272 TraceCheckUtils]: 46: Hoare triple {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,787 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5428#true} {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 17:12:49,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {5569#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:49,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:49,787 INFO L272 TraceCheckUtils]: 53: Hoare triple {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,788 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5428#true} {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 17:12:49,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {5591#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:12:49,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !false; {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:12:49,789 INFO L272 TraceCheckUtils]: 60: Hoare triple {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,789 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5428#true} {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #57#return; {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:12:49,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {5613#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-15 17:12:49,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !false; {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-15 17:12:49,790 INFO L272 TraceCheckUtils]: 67: Hoare triple {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,791 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5428#true} {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} #57#return; {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-15 17:12:49,791 INFO L290 TraceCheckUtils]: 72: Hoare triple {5635#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-15 17:12:49,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !false; {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-15 17:12:49,792 INFO L272 TraceCheckUtils]: 74: Hoare triple {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,792 INFO L290 TraceCheckUtils]: 75: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,792 INFO L290 TraceCheckUtils]: 76: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,799 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5428#true} {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} #57#return; {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-15 17:12:49,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {5657#(and (= main_~y~0 8) (= 5 (+ main_~c~0 (- 3))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 17:12:49,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 17:12:49,800 INFO L272 TraceCheckUtils]: 81: Hoare triple {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,800 INFO L290 TraceCheckUtils]: 82: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,801 INFO L290 TraceCheckUtils]: 84: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,801 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5428#true} {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-15 17:12:49,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {5679#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-15 17:12:49,802 INFO L272 TraceCheckUtils]: 87: Hoare triple {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5428#true} is VALID [2022-04-15 17:12:49,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {5428#true} ~cond := #in~cond; {5428#true} is VALID [2022-04-15 17:12:49,802 INFO L290 TraceCheckUtils]: 89: Hoare triple {5428#true} assume !(0 == ~cond); {5428#true} is VALID [2022-04-15 17:12:49,802 INFO L290 TraceCheckUtils]: 90: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 17:12:49,803 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5428#true} {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-15 17:12:49,803 INFO L272 TraceCheckUtils]: 92: Hoare triple {5701#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:12:49,803 INFO L290 TraceCheckUtils]: 93: Hoare triple {5720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:12:49,804 INFO L290 TraceCheckUtils]: 94: Hoare triple {5724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5429#false} is VALID [2022-04-15 17:12:49,804 INFO L290 TraceCheckUtils]: 95: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-15 17:12:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 17:12:49,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:12:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:12:50,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788171475] [2022-04-15 17:12:50,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:12:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634354493] [2022-04-15 17:12:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634354493] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:12:50,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:12:50,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-15 17:12:50,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:12:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1052368074] [2022-04-15 17:12:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1052368074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:12:50,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:12:50,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 17:12:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439621034] [2022-04-15 17:12:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:12:50,055 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-15 17:12:50,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:12:50,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 17:12:50,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:12:50,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 17:12:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 17:12:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 17:12:50,103 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 17:12:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:51,184 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-15 17:12:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 17:12:51,184 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-15 17:12:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:12:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 17:12:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-15 17:12:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 17:12:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-15 17:12:51,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-15 17:12:51,264 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 17:12:51,265 INFO L225 Difference]: With dead ends: 66 [2022-04-15 17:12:51,265 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 17:12:51,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-15 17:12:51,265 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 17:12:51,265 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 17:12:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 17:12:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 17:12:51,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:12:51,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 17:12:51,311 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 17:12:51,311 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 17:12:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:51,313 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 17:12:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 17:12:51,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:51,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:51,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-15 17:12:51,313 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-15 17:12:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:12:51,315 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 17:12:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 17:12:51,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:12:51,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:12:51,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:12:51,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:12:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 17:12:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-15 17:12:51,316 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-15 17:12:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:12:51,316 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-15 17:12:51,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-15 17:12:51,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions. [2022-04-15 17:12:52,384 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 17:12:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 17:12:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 17:12:52,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:12:52,385 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:12:52,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 17:12:52,597 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 17:12:52,597 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:12:52,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:12:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times [2022-04-15 17:12:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:12:52,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896228625] [2022-04-15 17:12:52,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:12:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times [2022-04-15 17:12:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:12:52,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107630623] [2022-04-15 17:12:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:12:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:12:52,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:12:52,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756967023] [2022-04-15 17:12:52,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:12:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:12:52,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:12:52,610 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 17:12:52,611 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 17:15:36,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:15:36,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:15:36,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 17:15:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:15:36,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:15:37,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {6163#true} call ULTIMATE.init(); {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {6163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6163#true} {6163#true} #63#return; {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {6163#true} call #t~ret5 := main(); {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {6163#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {6163#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6163#true} {6163#true} #53#return; {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L272 TraceCheckUtils]: 11: Hoare triple {6163#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,086 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6163#true} {6163#true} #55#return; {6163#true} is VALID [2022-04-15 17:15:37,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {6163#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:15:37,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {6216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:15:37,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {6216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,087 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6163#true} {6216#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:15:37,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {6216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 17:15:37,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 17:15:37,088 INFO L272 TraceCheckUtils]: 25: Hoare triple {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,089 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6163#true} {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 17:15:37,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {6238#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:15:37,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !false; {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:15:37,090 INFO L272 TraceCheckUtils]: 32: Hoare triple {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,091 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6163#true} {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} #57#return; {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 17:15:37,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {6260#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 17:15:37,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 17:15:37,092 INFO L272 TraceCheckUtils]: 39: Hoare triple {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,093 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6163#true} {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #57#return; {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 17:15:37,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {6282#(and (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 17:15:37,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 17:15:37,094 INFO L272 TraceCheckUtils]: 46: Hoare triple {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,095 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6163#true} {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 17:15:37,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {6304#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 17:15:37,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 17:15:37,096 INFO L272 TraceCheckUtils]: 53: Hoare triple {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,096 INFO L290 TraceCheckUtils]: 56: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,096 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6163#true} {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-15 17:15:37,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {6326#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 17:15:37,100 INFO L290 TraceCheckUtils]: 59: Hoare triple {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} assume !false; {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 17:15:37,100 INFO L272 TraceCheckUtils]: 60: Hoare triple {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,100 INFO L290 TraceCheckUtils]: 61: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,101 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6163#true} {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} #57#return; {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-15 17:15:37,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {6348#(and (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-15 17:15:37,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} assume !false; {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-15 17:15:37,102 INFO L272 TraceCheckUtils]: 67: Hoare triple {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,103 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6163#true} {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} #57#return; {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} is VALID [2022-04-15 17:15:37,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {6370#(and (= (+ main_~c~0 (- 7)) 0) (< main_~c~0 (+ 7 main_~k~0)) (= (+ main_~y~0 (- 3)) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-15 17:15:37,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !false; {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-15 17:15:37,104 INFO L272 TraceCheckUtils]: 74: Hoare triple {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,104 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6163#true} {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} #57#return; {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-15 17:15:37,105 INFO L290 TraceCheckUtils]: 79: Hoare triple {6392#(and (= main_~y~0 8) (= main_~c~0 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-15 17:15:37,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !false; {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-15 17:15:37,105 INFO L272 TraceCheckUtils]: 81: Hoare triple {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,105 INFO L290 TraceCheckUtils]: 82: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,105 INFO L290 TraceCheckUtils]: 83: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,105 INFO L290 TraceCheckUtils]: 84: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,106 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6163#true} {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} #57#return; {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} is VALID [2022-04-15 17:15:37,106 INFO L290 TraceCheckUtils]: 86: Hoare triple {6414#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 17:15:37,106 INFO L290 TraceCheckUtils]: 87: Hoare triple {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 17:15:37,107 INFO L272 TraceCheckUtils]: 88: Hoare triple {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,107 INFO L290 TraceCheckUtils]: 89: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,107 INFO L290 TraceCheckUtils]: 90: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,107 INFO L290 TraceCheckUtils]: 91: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,107 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6163#true} {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 17:15:37,108 INFO L290 TraceCheckUtils]: 93: Hoare triple {6436#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 17:15:37,108 INFO L272 TraceCheckUtils]: 94: Hoare triple {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6163#true} is VALID [2022-04-15 17:15:37,108 INFO L290 TraceCheckUtils]: 95: Hoare triple {6163#true} ~cond := #in~cond; {6163#true} is VALID [2022-04-15 17:15:37,108 INFO L290 TraceCheckUtils]: 96: Hoare triple {6163#true} assume !(0 == ~cond); {6163#true} is VALID [2022-04-15 17:15:37,108 INFO L290 TraceCheckUtils]: 97: Hoare triple {6163#true} assume true; {6163#true} is VALID [2022-04-15 17:15:37,108 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6163#true} {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #59#return; {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-15 17:15:37,109 INFO L272 TraceCheckUtils]: 99: Hoare triple {6458#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6477#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:15:37,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {6477#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6481#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:15:37,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {6481#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6164#false} is VALID [2022-04-15 17:15:37,110 INFO L290 TraceCheckUtils]: 102: Hoare triple {6164#false} assume !false; {6164#false} is VALID [2022-04-15 17:15:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 17:15:37,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:15:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:15:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107630623] [2022-04-15 17:15:38,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:15:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756967023] [2022-04-15 17:15:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756967023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:15:38,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:15:38,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-15 17:15:38,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:15:38,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896228625] [2022-04-15 17:15:38,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896228625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:15:38,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:15:38,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 17:15:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87746075] [2022-04-15 17:15:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:15:38,066 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-15 17:15:38,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:15:38,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 17:15:38,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:15:38,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 17:15:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:15:38,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 17:15:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-04-15 17:15:38,115 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 17:15:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:15:39,447 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-15 17:15:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 17:15:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-15 17:15:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:15:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 17:15:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-15 17:15:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 17:15:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-15 17:15:39,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-15 17:15:39,509 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 17:15:39,510 INFO L225 Difference]: With dead ends: 69 [2022-04-15 17:15:39,510 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 17:15:39,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-04-15 17:15:39,511 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 17:15:39,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 17:15:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 17:15:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 17:15:39,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:15:39,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 17:15:39,571 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 17:15:39,571 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 17:15:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:15:39,573 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 17:15:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 17:15:39,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:15:39,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:15:39,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-15 17:15:39,573 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-15 17:15:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:15:39,574 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 17:15:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 17:15:39,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:15:39,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:15:39,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:15:39,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:15:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 17:15:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-15 17:15:39,576 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-15 17:15:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:15:39,576 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-15 17:15:39,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-15 17:15:39,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-15 17:15:40,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:15:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-15 17:15:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 17:15:40,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:15:40,125 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:15:40,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 17:15:40,327 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 17:15:40,327 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:15:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:15:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times [2022-04-15 17:15:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:15:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124163853] [2022-04-15 17:15:40,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:15:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times [2022-04-15 17:15:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:15:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907512882] [2022-04-15 17:15:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:15:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:15:40,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:15:40,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693743270] [2022-04-15 17:15:40,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 17:15:40,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:15:40,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:15:40,341 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 17:15:40,342 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 17:15:40,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 17:15:40,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:15:40,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 17:15:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:15:40,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:15:40,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-15 17:15:40,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {7136#true} is VALID [2022-04-15 17:15:40,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7136#true} {7136#true} #63#return; {7136#true} is VALID [2022-04-15 17:15:40,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {7136#true} call #t~ret5 := main(); {7136#true} is VALID [2022-04-15 17:15:40,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {7136#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {7136#true} is VALID [2022-04-15 17:15:40,899 INFO L272 TraceCheckUtils]: 6: Hoare triple {7136#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7136#true} #53#return; {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L272 TraceCheckUtils]: 11: Hoare triple {7136#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7136#true} {7136#true} #55#return; {7136#true} is VALID [2022-04-15 17:15:40,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:15:40,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {7189#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:15:40,901 INFO L272 TraceCheckUtils]: 18: Hoare triple {7189#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,902 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7136#true} {7189#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {7189#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 17:15:40,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {7189#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:15:40,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:15:40,903 INFO L272 TraceCheckUtils]: 25: Hoare triple {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,904 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7136#true} {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 17:15:40,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {7211#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 17:15:40,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 17:15:40,905 INFO L272 TraceCheckUtils]: 32: Hoare triple {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,906 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7136#true} {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 17:15:40,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {7233#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 17:15:40,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 17:15:40,907 INFO L272 TraceCheckUtils]: 39: Hoare triple {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,920 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7136#true} {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-15 17:15:40,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {7255#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 17:15:40,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 17:15:40,921 INFO L272 TraceCheckUtils]: 46: Hoare triple {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,922 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #57#return; {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 17:15:40,922 INFO L290 TraceCheckUtils]: 51: Hoare triple {7277#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 17:15:40,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 17:15:40,923 INFO L272 TraceCheckUtils]: 53: Hoare triple {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,923 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {7136#true} {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-15 17:15:40,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {7299#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:15:40,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:15:40,924 INFO L272 TraceCheckUtils]: 60: Hoare triple {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,925 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7136#true} {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:15:40,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {7321#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-15 17:15:40,926 INFO L290 TraceCheckUtils]: 66: Hoare triple {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-15 17:15:40,926 INFO L272 TraceCheckUtils]: 67: Hoare triple {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,927 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7136#true} {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #57#return; {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-15 17:15:40,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {7343#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-15 17:15:40,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !false; {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-15 17:15:40,927 INFO L272 TraceCheckUtils]: 74: Hoare triple {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,928 INFO L290 TraceCheckUtils]: 76: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,928 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7136#true} {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} #57#return; {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} is VALID [2022-04-15 17:15:40,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {7365#(and (= 6 (+ (- 2) main_~c~0)) (= main_~y~0 8))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:15:40,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !false; {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:15:40,929 INFO L272 TraceCheckUtils]: 81: Hoare triple {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,929 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {7136#true} {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} #57#return; {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 17:15:40,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {7387#(and (= (+ main_~c~0 (- 3)) 6) (= 8 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-15 17:15:40,930 INFO L290 TraceCheckUtils]: 87: Hoare triple {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !false; {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-15 17:15:40,930 INFO L272 TraceCheckUtils]: 88: Hoare triple {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,931 INFO L290 TraceCheckUtils]: 91: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,931 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {7136#true} {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} #57#return; {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} is VALID [2022-04-15 17:15:40,931 INFO L290 TraceCheckUtils]: 93: Hoare triple {7409#(and (= 6 (+ main_~c~0 (- 4))) (= main_~y~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 17:15:40,932 INFO L290 TraceCheckUtils]: 94: Hoare triple {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !false; {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 17:15:40,932 INFO L272 TraceCheckUtils]: 95: Hoare triple {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,932 INFO L290 TraceCheckUtils]: 96: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,932 INFO L290 TraceCheckUtils]: 97: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,932 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7136#true} {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #57#return; {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 17:15:40,933 INFO L290 TraceCheckUtils]: 100: Hoare triple {7431#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 17:15:40,933 INFO L272 TraceCheckUtils]: 101: Hoare triple {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7136#true} is VALID [2022-04-15 17:15:40,933 INFO L290 TraceCheckUtils]: 102: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-15 17:15:40,933 INFO L290 TraceCheckUtils]: 103: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-15 17:15:40,933 INFO L290 TraceCheckUtils]: 104: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-15 17:15:40,934 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7136#true} {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} #59#return; {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-15 17:15:40,934 INFO L272 TraceCheckUtils]: 106: Hoare triple {7453#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7472#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:15:40,935 INFO L290 TraceCheckUtils]: 107: Hoare triple {7472#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7476#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:15:40,935 INFO L290 TraceCheckUtils]: 108: Hoare triple {7476#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7137#false} is VALID [2022-04-15 17:15:40,935 INFO L290 TraceCheckUtils]: 109: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-15 17:15:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 17:15:40,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 17:15:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:15:41,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907512882] [2022-04-15 17:15:41,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:15:41,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693743270] [2022-04-15 17:15:41,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693743270] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 17:15:41,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 17:15:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-15 17:15:41,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:15:41,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124163853] [2022-04-15 17:15:41,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124163853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:15:41,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:15:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 17:15:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162447735] [2022-04-15 17:15:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:15:41,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-15 17:15:41,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:15:41,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 17:15:41,252 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 17:15:41,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 17:15:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:15:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 17:15:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-15 17:15:41,253 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 17:15:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:15:42,701 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-15 17:15:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 17:15:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-15 17:15:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:15:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 17:15:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-15 17:15:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 17:15:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-15 17:15:42,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-15 17:15:42,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:15:42,774 INFO L225 Difference]: With dead ends: 72 [2022-04-15 17:15:42,774 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 17:15:42,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-15 17:15:42,774 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 17:15:42,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 17:15:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 17:15:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 17:15:42,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:15:42,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 17:15:42,830 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 17:15:42,830 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 17:15:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:15:42,832 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 17:15:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 17:15:42,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:15:42,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:15:42,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-15 17:15:42,832 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-15 17:15:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:15:42,833 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 17:15:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 17:15:42,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:15:42,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:15:42,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:15:42,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:15:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 17:15:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-15 17:15:42,835 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-15 17:15:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:15:42,835 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-15 17:15:42,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-15 17:15:42,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-15 17:15:43,231 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 17:15:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-15 17:15:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 17:15:43,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:15:43,232 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:15:43,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 17:15:43,451 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 17:15:43,451 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:15:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:15:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times [2022-04-15 17:15:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:15:43,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120400768] [2022-04-15 17:15:43,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:15:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times [2022-04-15 17:15:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:15:43,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113985928] [2022-04-15 17:15:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:15:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:15:43,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:15:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936091384] [2022-04-15 17:15:43,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 17:15:43,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:15:43,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:15:43,464 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 17:15:43,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process