/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_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:33:35,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:33:35,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:33:35,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:33:35,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:33:35,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:33:35,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:33:35,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:33:35,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:33:35,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:33:35,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:33:35,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:33:35,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:33:35,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:33:35,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:33:35,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:33:35,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:33:35,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:33:35,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:33:35,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:33:35,582 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:33:35,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:33:35,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:33:35,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:33:35,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:33:35,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:33:35,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:33:35,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:33:35,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:33:35,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:33:35,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:33:35,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:33:35,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:33:35,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:33:35,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:33:35,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:33:35,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:33:35,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:33:35,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:33:35,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:33:35,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:33:35,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:33:35,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:33:35,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:33:35,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:33:35,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:33:35,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:33:35,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:33:35,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:33:35,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:33:35,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:33:35,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:33:35,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:33:35,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:33:35,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:33:35,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:33:35,607 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:33:35,607 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-28 14:33:35,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:33:35,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:33:35,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:33:35,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:33:35,794 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:33:35,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c [2022-04-28 14:33:35,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c240c7439/548e466111784bda9f537c174c46dfb2/FLAGb721643a8 [2022-04-28 14:33:36,194 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:33:36,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound5.c [2022-04-28 14:33:36,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c240c7439/548e466111784bda9f537c174c46dfb2/FLAGb721643a8 [2022-04-28 14:33:36,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c240c7439/548e466111784bda9f537c174c46dfb2 [2022-04-28 14:33:36,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:33:36,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:33:36,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:33:36,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:33:36,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:33:36,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c6c70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36, skipping insertion in model container [2022-04-28 14:33:36,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:33:36,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:33:36,336 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_valuebound5.c[458,471] [2022-04-28 14:33:36,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:33:36,361 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:33:36,376 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_valuebound5.c[458,471] [2022-04-28 14:33:36,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:33:36,390 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:33:36,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36 WrapperNode [2022-04-28 14:33:36,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:33:36,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:33:36,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:33:36,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:33:36,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:33:36,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:33:36,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:33:36,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:33:36,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (1/1) ... [2022-04-28 14:33:36,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:33:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:36,441 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-28 14:33:36,449 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-28 14:33:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:33:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:33:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:33:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:33:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:33:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:33:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:33:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:33:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:33:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:33:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:33:36,512 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:33:36,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:33:36,653 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:33:36,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:33:36,659 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:33:36,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:33:36 BoogieIcfgContainer [2022-04-28 14:33:36,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:33:36,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:33:36,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:33:36,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:33:36,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:33:36" (1/3) ... [2022-04-28 14:33:36,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ff7ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:33:36, skipping insertion in model container [2022-04-28 14:33:36,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:33:36" (2/3) ... [2022-04-28 14:33:36,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ff7ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:33:36, skipping insertion in model container [2022-04-28 14:33:36,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:33:36" (3/3) ... [2022-04-28 14:33:36,679 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound5.c [2022-04-28 14:33:36,690 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:33:36,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:33:36,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:33:36,728 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41560ee6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@516fde06 [2022-04-28 14:33:36,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:33:36,733 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-28 14:33:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:33:36,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:36,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:33:36,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-28 14:33:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:36,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133016175] [2022-04-28 14:33:36,760 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-28 14:33:36,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:36,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77402471] [2022-04-28 14:33:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:33:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:36,914 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-28 14:33:36,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:33:36,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 14:33:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:33:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:36,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:33:36,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:33:36,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:33:36,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:33:36,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 14:33:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:36,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:33:36,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:33:36,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:33:36,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 14:33:36,928 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-28 14:33:36,928 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-28 14:33:36,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 14:33:36,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 14:33:36,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 14:33:36,929 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-28 14:33:36,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {32#true} is VALID [2022-04-28 14:33:36,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:33:36,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:33:36,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:33:36,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 14:33:36,930 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-28 14:33:36,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 14:33:36,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 14:33:36,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 14:33:36,931 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 14:33:36,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 14:33:36,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 14:33:36,931 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-28 14:33:36,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 14:33:36,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 14:33:36,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 14:33:36,932 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-28 14:33:36,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:36,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77402471] [2022-04-28 14:33:36,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77402471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:36,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:36,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:33:36,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:36,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133016175] [2022-04-28 14:33:36,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133016175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:36,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:36,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:33:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707136996] [2022-04-28 14:33:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:36,939 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-28 14:33:36,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:36,942 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-28 14:33:36,959 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-28 14:33:36,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:33:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:33:36,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:33:36,973 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-28 14:33:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:37,098 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-28 14:33:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:33:37,098 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-28 14:33:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:37,099 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-28 14:33:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 14:33:37,111 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-28 14:33:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 14:33:37,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-28 14:33:37,189 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-28 14:33:37,199 INFO L225 Difference]: With dead ends: 51 [2022-04-28 14:33:37,199 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 14:33:37,201 INFO L412 NwaCegarLoop]: 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-28 14:33:37,205 INFO L413 NwaCegarLoop]: 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-28 14:33:37,205 INFO L414 NwaCegarLoop]: 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-28 14:33:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 14:33:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 14:33:37,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:37,236 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-28 14:33:37,236 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-28 14:33:37,237 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-28 14:33:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:37,240 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 14:33:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:33:37,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:37,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:37,241 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-28 14:33:37,253 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-28 14:33:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:37,263 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 14:33:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:33:37,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:37,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:37,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:37,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:37,273 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-28 14:33:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 14:33:37,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 14:33:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:37,284 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 14:33:37,285 INFO L496 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-28 14:33:37,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 14:33:37,312 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-28 14:33:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 14:33:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 14:33:37,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:37,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:33:37,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:33:37,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-28 14:33:37,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:37,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780531705] [2022-04-28 14:33:37,315 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-28 14:33:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305043090] [2022-04-28 14:33:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:37,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983634595] [2022-04-28 14:33:37,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:33:37,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:37,332 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-28 14:33:37,347 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-28 14:33:37,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:33:37,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:37,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:33:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:37,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:37,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 14:33:37,542 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-28 14:33:37,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 14:33:37,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-28 14:33:37,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-28 14:33:37,542 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-28 14:33:37,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {246#true} is VALID [2022-04-28 14:33:37,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 14:33:37,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 14:33:37,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 14:33:37,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 14:33:37,546 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-28 14:33:37,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 14:33:37,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 14:33:37,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 14:33:37,549 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 14:33:37,550 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-28 14:33:37,552 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-28 14:33:37,554 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-28 14:33:37,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:37,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 14:33:37,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 14:33:37,556 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-28 14:33:37,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:33:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305043090] [2022-04-28 14:33:37,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983634595] [2022-04-28 14:33:37,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983634595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:37,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:37,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:33:37,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780531705] [2022-04-28 14:33:37,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780531705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:37,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:37,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:33:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983312715] [2022-04-28 14:33:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:37,560 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-28 14:33:37,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:37,560 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-28 14:33:37,574 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-28 14:33:37,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:33:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:33:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:33:37,576 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-28 14:33:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:37,689 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 14:33:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:33:37,690 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-28 14:33:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:37,691 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-28 14:33:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 14:33:37,700 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-28 14:33:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 14:33:37,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 14:33:37,729 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-28 14:33:37,731 INFO L225 Difference]: With dead ends: 35 [2022-04-28 14:33:37,731 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 14:33:37,732 INFO L412 NwaCegarLoop]: 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-28 14:33:37,734 INFO L413 NwaCegarLoop]: 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-28 14:33:37,735 INFO L414 NwaCegarLoop]: 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-28 14:33:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 14:33:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 14:33:37,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:37,744 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-28 14:33:37,744 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-28 14:33:37,744 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-28 14:33:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:37,746 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 14:33:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 14:33:37,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:37,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:37,747 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-28 14:33:37,747 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-28 14:33:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:37,749 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 14:33:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 14:33:37,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:37,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:37,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:37,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:37,750 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-28 14:33:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 14:33:37,751 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-28 14:33:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:37,751 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 14:33:37,752 INFO L496 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-28 14:33:37,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 14:33:37,779 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-28 14:33:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 14:33:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 14:33:37,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:37,780 INFO L195 NwaCegarLoop]: 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-28 14:33:37,799 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-28 14:33:37,999 WARN L477 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-28 14:33:38,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-28 14:33:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:38,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081408293] [2022-04-28 14:33:38,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-28 14:33:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:38,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608535595] [2022-04-28 14:33:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:38,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862303783] [2022-04-28 14:33:38,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:33:38,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:38,018 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-28 14:33:38,019 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-28 14:33:38,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:33:38,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:38,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:33:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:38,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:38,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 14:33:38,233 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-28 14:33:38,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:38,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 14:33:38,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 14:33:38,234 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-28 14:33:38,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {512#true} is VALID [2022-04-28 14:33:38,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 14:33:38,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 14:33:38,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:38,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 14:33:38,234 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-28 14:33:38,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 14:33:38,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 14:33:38,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:38,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 14:33:38,235 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-28 14:33:38,236 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-28 14:33:38,236 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-28 14:33:38,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 14:33:38,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 14:33:38,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:38,237 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-28 14:33:38,237 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-28 14:33:38,238 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-28 14:33:38,238 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-28 14:33:38,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:38,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 14:33:38,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 14:33:38,240 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-28 14:33:38,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:38,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 14:33:38,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 14:33:38,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:38,401 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-28 14:33:38,401 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-28 14:33:40,411 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-28 14:33:40,414 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-28 14:33:40,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:40,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 14:33:40,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 14:33:40,414 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-28 14:33:40,415 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-28 14:33:40,415 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-28 14:33:40,415 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 14:33:40,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:40,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 14:33:40,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 14:33:40,416 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-28 14:33:40,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 14:33:40,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:40,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 14:33:40,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 14:33:40,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {512#true} is VALID [2022-04-28 14:33:40,417 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-28 14:33:40,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 14:33:40,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 14:33:40,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 14:33:40,418 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-28 14:33:40,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 14:33:40,418 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-28 14:33:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608535595] [2022-04-28 14:33:40,418 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862303783] [2022-04-28 14:33:40,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862303783] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:33:40,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:33:40,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:33:40,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:40,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081408293] [2022-04-28 14:33:40,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081408293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:40,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:40,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:33:40,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533940463] [2022-04-28 14:33:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:40,420 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-28 14:33:40,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:40,420 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-28 14:33:41,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:33:41,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:33:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:33:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:33:41,122 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-28 14:33:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:41,227 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 14:33:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:33:41,228 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-28 14:33:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:41,228 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-28 14:33:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:33:41,229 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-28 14:33:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 14:33:41,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 14:33:41,603 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-28 14:33:41,604 INFO L225 Difference]: With dead ends: 37 [2022-04-28 14:33:41,604 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 14:33:41,604 INFO L412 NwaCegarLoop]: 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-28 14:33:41,605 INFO L413 NwaCegarLoop]: 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-28 14:33:41,605 INFO L414 NwaCegarLoop]: 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-28 14:33:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 14:33:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 14:33:41,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:41,622 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-28 14:33:41,622 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-28 14:33:41,622 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-28 14:33:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:41,624 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 14:33:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 14:33:41,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:41,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:41,624 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-28 14:33:41,624 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-28 14:33:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:41,626 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 14:33:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 14:33:41,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:41,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:41,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:41,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:41,626 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-28 14:33:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 14:33:41,628 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 14:33:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:41,628 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 14:33:41,628 INFO L496 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-28 14:33:41,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 14:33:42,405 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-28 14:33:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 14:33:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 14:33:42,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:42,406 INFO L195 NwaCegarLoop]: 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-28 14:33:42,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:33:42,606 WARN L477 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-28 14:33:42,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-28 14:33:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:42,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308847669] [2022-04-28 14:33:42,608 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-28 14:33:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:42,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971637701] [2022-04-28 14:33:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:42,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257154117] [2022-04-28 14:33:42,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:33:42,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:42,622 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-28 14:33:42,623 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-28 14:33:42,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:33:42,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:42,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:33:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:42,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:42,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-28 14:33:42,902 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-28 14:33:42,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 14:33:42,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-28 14:33:42,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-28 14:33:42,903 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-28 14:33:42,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {900#true} is VALID [2022-04-28 14:33:42,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 14:33:42,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 14:33:42,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 14:33:42,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-28 14:33:42,904 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-28 14:33:42,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 14:33:42,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 14:33:42,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 14:33:42,904 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-28 14:33:42,905 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-28 14:33:42,905 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-28 14:33:42,905 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-28 14:33:42,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 14:33:42,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 14:33:42,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 14:33:42,906 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-28 14:33:42,907 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-28 14:33:42,907 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-28 14:33:42,908 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-28 14:33:42,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 14:33:42,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 14:33:42,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 14:33:42,909 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-28 14:33:42,923 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-28 14:33:42,923 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-28 14:33:42,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 14:33:42,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 14:33:42,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 14:33:42,924 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-28 14:33:42,924 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-28 14:33:42,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:42,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-28 14:33:42,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-28 14:33:42,925 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-28 14:33:42,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:43,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971637701] [2022-04-28 14:33:43,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257154117] [2022-04-28 14:33:43,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257154117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:33:43,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:33:43,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:33:43,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308847669] [2022-04-28 14:33:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308847669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:43,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:43,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:33:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247417185] [2022-04-28 14:33:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:43,209 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-28 14:33:43,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:43,210 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-28 14:33:43,237 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-28 14:33:43,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:33:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:43,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:33:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:33:43,239 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-28 14:33:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:43,464 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 14:33:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:33:43,464 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-28 14:33:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:43,464 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-28 14:33:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 14:33:43,466 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-28 14:33:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 14:33:43,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 14:33:43,496 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-28 14:33:43,497 INFO L225 Difference]: With dead ends: 42 [2022-04-28 14:33:43,497 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 14:33:43,497 INFO L412 NwaCegarLoop]: 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-28 14:33:43,498 INFO L413 NwaCegarLoop]: 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-28 14:33:43,498 INFO L414 NwaCegarLoop]: 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-28 14:33:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 14:33:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 14:33:43,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:43,516 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-28 14:33:43,517 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-28 14:33:43,518 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-28 14:33:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:43,521 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 14:33:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 14:33:43,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:43,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:43,525 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-28 14:33:43,527 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-28 14:33:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:43,530 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 14:33:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 14:33:43,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:43,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:43,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:43,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:43,531 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-28 14:33:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 14:33:43,532 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-28 14:33:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:43,532 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 14:33:43,532 INFO L496 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-28 14:33:43,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-28 14:33:44,102 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-28 14:33:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 14:33:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 14:33:44,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:44,103 INFO L195 NwaCegarLoop]: 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-28 14:33:44,122 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-28 14:33:44,309 WARN L477 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-28 14:33:44,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-28 14:33:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:44,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487155950] [2022-04-28 14:33:44,310 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-28 14:33:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:44,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211033633] [2022-04-28 14:33:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:44,323 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:44,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490286559] [2022-04-28 14:33:44,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:33:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:44,326 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-28 14:33:44,327 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-28 14:33:44,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:33:44,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:44,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 14:33:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:44,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:44,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-28 14:33:44,666 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-28 14:33:44,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-28 14:33:44,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-28 14:33:44,666 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-28 14:33:44,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-28 14:33:44,667 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-28 14:33:44,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-28 14:33:44,668 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-28 14:33:44,668 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-28 14:33:44,669 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-28 14:33:44,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 14:33:44,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 14:33:44,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,670 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-28 14:33:44,671 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) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:44,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:44,672 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 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)); {1315#true} is VALID [2022-04-28 14:33:44,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 14:33:44,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 14:33:44,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,674 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:44,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~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; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:33:44,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:33:44,678 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~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)); {1315#true} is VALID [2022-04-28 14:33:44,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 14:33:44,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 14:33:44,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,679 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:33:44,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:33:44,679 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~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)); {1315#true} is VALID [2022-04-28 14:33:44,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 14:33:44,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 14:33:44,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 14:33:44,680 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:33:44,681 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:33:44,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:44,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-28 14:33:44,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-28 14:33:44,685 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-28 14:33:44,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211033633] [2022-04-28 14:33:45,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490286559] [2022-04-28 14:33:45,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490286559] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:33:45,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:33:45,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 14:33:45,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:45,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487155950] [2022-04-28 14:33:45,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487155950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:45,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:45,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:33:45,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739895016] [2022-04-28 14:33:45,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:45,016 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-28 14:33:45,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:45,017 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-28 14:33:45,041 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-28 14:33:45,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:33:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:33:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:33:45,042 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-28 14:33:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:45,321 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 14:33:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:33:45,321 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-28 14:33:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:45,322 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-28 14:33:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 14:33:45,323 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-28 14:33:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 14:33:45,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 14:33:45,357 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-28 14:33:45,358 INFO L225 Difference]: With dead ends: 45 [2022-04-28 14:33:45,358 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 14:33:45,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:33:45,359 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:33:45,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:33:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 14:33:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 14:33:45,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:45,376 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-28 14:33:45,376 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-28 14:33:45,376 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-28 14:33:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:45,377 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 14:33:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 14:33:45,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:45,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:45,378 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-28 14:33:45,378 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-28 14:33:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:45,379 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 14:33:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 14:33:45,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:45,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:45,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:45,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:45,380 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-28 14:33:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 14:33:45,381 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-28 14:33:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:45,381 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 14:33:45,382 INFO L496 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-28 14:33:45,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 14:33:46,469 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-28 14:33:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 14:33:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 14:33:46,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:46,470 INFO L195 NwaCegarLoop]: 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-28 14:33:46,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:33:46,671 WARN L477 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-28 14:33:46,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-28 14:33:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986153640] [2022-04-28 14:33:46,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-28 14:33:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361404875] [2022-04-28 14:33:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:46,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:46,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744201544] [2022-04-28 14:33:46,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:33:46,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:46,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:46,686 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-28 14:33:46,687 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-28 14:33:47,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:33:47,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:47,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:33:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:47,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:47,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#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); {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #63#return; {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret5 := main(); {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#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; {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1792#true} {1792#true} #53#return; {1792#true} is VALID [2022-04-28 14:33:47,574 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1792#true} is VALID [2022-04-28 14:33:47,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,574 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #55#return; {1792#true} is VALID [2022-04-28 14:33:47,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:47,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:47,575 INFO L272 TraceCheckUtils]: 18: Hoare triple {1845#(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)); {1792#true} is VALID [2022-04-28 14:33:47,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,576 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1845#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:47,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#(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; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:47,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:47,577 INFO L272 TraceCheckUtils]: 25: Hoare triple {1867#(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)); {1792#true} is VALID [2022-04-28 14:33:47,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,577 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:47,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(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; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:33:47,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:33:47,579 INFO L272 TraceCheckUtils]: 32: Hoare triple {1889#(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)); {1792#true} is VALID [2022-04-28 14:33:47,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,579 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1792#true} {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 14:33:47,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#(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; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:33:47,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:33:47,580 INFO L272 TraceCheckUtils]: 39: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 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)); {1792#true} is VALID [2022-04-28 14:33:47,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,581 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1792#true} {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:33:47,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:33:47,582 INFO L272 TraceCheckUtils]: 45: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 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)); {1792#true} is VALID [2022-04-28 14:33:47,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-28 14:33:47,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-28 14:33:47,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-28 14:33:47,583 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1792#true} {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:33:47,583 INFO L272 TraceCheckUtils]: 50: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:33:47,584 INFO L290 TraceCheckUtils]: 51: Hoare triple {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1956#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:47,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {1956#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-04-28 14:33:47,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-28 14:33:47,585 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-28 14:33:47,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:47,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:47,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361404875] [2022-04-28 14:33:47,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:47,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744201544] [2022-04-28 14:33:47,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744201544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:33:47,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:33:47,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:33:47,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:47,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986153640] [2022-04-28 14:33:47,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986153640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:47,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:47,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:33:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667645393] [2022-04-28 14:33:47,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:47,855 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-28 14:33:47,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:47,855 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-28 14:33:47,881 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-28 14:33:47,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:33:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:33:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:33:47,882 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-28 14:33:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:48,232 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 14:33:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:33:48,233 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-28 14:33:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:48,233 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-28 14:33:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 14:33:48,245 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-28 14:33:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 14:33:48,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 14:33:48,286 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-28 14:33:48,287 INFO L225 Difference]: With dead ends: 48 [2022-04-28 14:33:48,287 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 14:33:48,288 INFO L412 NwaCegarLoop]: 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-28 14:33:48,288 INFO L413 NwaCegarLoop]: 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-28 14:33:48,288 INFO L414 NwaCegarLoop]: 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-28 14:33:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 14:33:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 14:33:48,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:48,322 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-28 14:33:48,323 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-28 14:33:48,323 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-28 14:33:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:48,326 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 14:33:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 14:33:48,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:48,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:48,327 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-28 14:33:48,327 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-28 14:33:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:48,329 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-28 14:33:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 14:33:48,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:48,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:48,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:48,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:48,329 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-28 14:33:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-28 14:33:48,331 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-28 14:33:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:48,331 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-28 14:33:48,331 INFO L496 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-28 14:33:48,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-28 14:33:48,708 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-28 14:33:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-28 14:33:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:33:48,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:48,709 INFO L195 NwaCegarLoop]: 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-28 14:33:48,716 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-28 14:33:48,914 WARN L477 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-28 14:33:48,915 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-28 14:33:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:48,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727093797] [2022-04-28 14:33:48,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-28 14:33:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:48,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679583773] [2022-04-28 14:33:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:48,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:48,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773929188] [2022-04-28 14:33:48,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:33:48,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:48,942 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-28 14:33:48,960 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-28 14:33:49,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:33:49,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:49,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:33:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:49,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:50,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {2287#true} call ULTIMATE.init(); {2287#true} is VALID [2022-04-28 14:33:50,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2287#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); {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2287#true} {2287#true} #63#return; {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {2287#true} call #t~ret5 := main(); {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {2287#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; {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2287#true} {2287#true} #53#return; {2287#true} is VALID [2022-04-28 14:33:50,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2287#true} is VALID [2022-04-28 14:33:50,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2287#true} {2287#true} #55#return; {2287#true} is VALID [2022-04-28 14:33:50,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {2287#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:50,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:50,136 INFO L272 TraceCheckUtils]: 18: Hoare triple {2340#(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)); {2287#true} is VALID [2022-04-28 14:33:50,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,137 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2287#true} {2340#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:50,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {2340#(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; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:33:50,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:33:50,138 INFO L272 TraceCheckUtils]: 25: Hoare triple {2362#(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)); {2287#true} is VALID [2022-04-28 14:33:50,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,139 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2287#true} {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:33:50,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {2362#(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; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:33:50,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:33:50,140 INFO L272 TraceCheckUtils]: 32: Hoare triple {2384#(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)); {2287#true} is VALID [2022-04-28 14:33:50,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,141 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2287#true} {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 14:33:50,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {2384#(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; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:33:50,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:33:50,142 INFO L272 TraceCheckUtils]: 39: Hoare triple {2406#(and (= main_~y~0 3) (= 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)); {2287#true} is VALID [2022-04-28 14:33:50,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,142 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2287#true} {2406#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:33:50,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:33:50,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:33:50,144 INFO L272 TraceCheckUtils]: 46: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 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)); {2287#true} is VALID [2022-04-28 14:33:50,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,145 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2287#true} {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:33:50,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:33:50,146 INFO L272 TraceCheckUtils]: 52: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 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)); {2287#true} is VALID [2022-04-28 14:33:50,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-28 14:33:50,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-28 14:33:50,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-28 14:33:50,147 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2287#true} {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:33:50,148 INFO L272 TraceCheckUtils]: 57: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:33:50,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:50,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {2473#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2288#false} is VALID [2022-04-28 14:33:50,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2022-04-28 14:33:50,150 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-28 14:33:50,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:50,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679583773] [2022-04-28 14:33:50,418 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:50,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773929188] [2022-04-28 14:33:50,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773929188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:33:50,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:33:50,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:33:50,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:50,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727093797] [2022-04-28 14:33:50,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727093797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:50,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:50,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:33:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807461306] [2022-04-28 14:33:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:50,421 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-28 14:33:50,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:50,421 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-28 14:33:50,453 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-28 14:33:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:33:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:33:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:33:50,454 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-28 14:33:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:50,923 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 14:33:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:33:50,923 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-28 14:33:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:50,924 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-28 14:33:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 14:33:50,927 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-28 14:33:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-28 14:33:50,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-28 14:33:50,970 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-28 14:33:50,972 INFO L225 Difference]: With dead ends: 51 [2022-04-28 14:33:50,972 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 14:33:50,972 INFO L412 NwaCegarLoop]: 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-28 14:33:50,973 INFO L413 NwaCegarLoop]: 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-28 14:33:50,974 INFO L414 NwaCegarLoop]: 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-28 14:33:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 14:33:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 14:33:51,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:51,013 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-28 14:33:51,013 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-28 14:33:51,013 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-28 14:33:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:51,015 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 14:33:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 14:33:51,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:51,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:51,015 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-28 14:33:51,015 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-28 14:33:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:51,017 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 14:33:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 14:33:51,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:51,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:51,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:51,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:51,018 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-28 14:33:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-28 14:33:51,019 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-28 14:33:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:51,019 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-28 14:33:51,019 INFO L496 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-28 14:33:51,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-28 14:33:51,323 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-28 14:33:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-28 14:33:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 14:33:51,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:51,327 INFO L195 NwaCegarLoop]: 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-28 14:33:51,332 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-28 14:33:51,531 WARN L477 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-28 14:33:51,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-28 14:33:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792887647] [2022-04-28 14:33:51,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:51,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-28 14:33:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:51,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183854445] [2022-04-28 14:33:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:51,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915236390] [2022-04-28 14:33:51,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:33:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:51,562 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-28 14:33:51,563 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-28 14:33:51,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:33:51,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:51,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:33:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:51,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:51,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#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); {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #63#return; {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret5 := main(); {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {2822#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; {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L272 TraceCheckUtils]: 6: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2822#true} {2822#true} #53#return; {2822#true} is VALID [2022-04-28 14:33:51,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2822#true} is VALID [2022-04-28 14:33:51,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,970 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2822#true} #55#return; {2822#true} is VALID [2022-04-28 14:33:51,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {2822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:51,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:51,973 INFO L272 TraceCheckUtils]: 18: Hoare triple {2875#(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)); {2822#true} is VALID [2022-04-28 14:33:51,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,977 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2822#true} {2875#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:33:51,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {2875#(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; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:51,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:51,979 INFO L272 TraceCheckUtils]: 25: Hoare triple {2897#(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)); {2822#true} is VALID [2022-04-28 14:33:51,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,979 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2822#true} {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:33:51,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {2897#(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; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:33:51,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:33:51,980 INFO L272 TraceCheckUtils]: 32: Hoare triple {2919#(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)); {2822#true} is VALID [2022-04-28 14:33:51,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,981 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2822#true} {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 14:33:51,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {2919#(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; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:33:51,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:33:51,982 INFO L272 TraceCheckUtils]: 39: Hoare triple {2941#(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)); {2822#true} is VALID [2022-04-28 14:33:51,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,983 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2822#true} {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 14:33:51,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {2941#(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; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:33:51,984 INFO L290 TraceCheckUtils]: 45: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:33:51,984 INFO L272 TraceCheckUtils]: 46: Hoare triple {2963#(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)); {2822#true} is VALID [2022-04-28 14:33:51,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,985 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2822#true} {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 14:33:51,985 INFO L290 TraceCheckUtils]: 51: Hoare triple {2963#(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; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:33:51,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:33:51,986 INFO L272 TraceCheckUtils]: 53: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 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)); {2822#true} is VALID [2022-04-28 14:33:51,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,987 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2822#true} {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:33:51,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:33:51,989 INFO L272 TraceCheckUtils]: 59: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 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)); {2822#true} is VALID [2022-04-28 14:33:51,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-28 14:33:51,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-28 14:33:51,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-28 14:33:51,990 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2822#true} {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 14:33:51,991 INFO L272 TraceCheckUtils]: 64: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:33:51,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:33:51,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {3030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2823#false} is VALID [2022-04-28 14:33:51,992 INFO L290 TraceCheckUtils]: 67: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2022-04-28 14:33:51,993 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-28 14:33:51,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183854445] [2022-04-28 14:33:52,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915236390] [2022-04-28 14:33:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915236390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:33:52,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:33:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:33:52,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792887647] [2022-04-28 14:33:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792887647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:52,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:33:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901429105] [2022-04-28 14:33:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:52,258 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-28 14:33:52,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:52,258 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-28 14:33:52,298 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-28 14:33:52,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:33:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:52,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:33:52,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:33:52,299 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-28 14:33:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:52,847 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 14:33:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:33:52,848 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-28 14:33:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:52,848 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-28 14:33:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 14:33:52,849 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-28 14:33:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 14:33:52,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 14:33:52,901 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-28 14:33:52,902 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:33:52,902 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 14:33:52,902 INFO L412 NwaCegarLoop]: 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-28 14:33:52,902 INFO L413 NwaCegarLoop]: 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-28 14:33:52,902 INFO L414 NwaCegarLoop]: 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-28 14:33:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 14:33:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 14:33:52,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:52,928 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-28 14:33:52,928 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-28 14:33:52,928 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-28 14:33:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:52,929 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 14:33:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 14:33:52,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:52,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:52,930 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-28 14:33:52,930 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-28 14:33:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:52,931 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 14:33:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 14:33:52,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:52,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:52,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:52,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:52,932 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-28 14:33:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-28 14:33:52,933 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-28 14:33:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:52,934 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-28 14:33:52,934 INFO L496 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-28 14:33:52,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-28 14:33:53,327 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-28 14:33:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-28 14:33:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 14:33:53,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:33:53,328 INFO L195 NwaCegarLoop]: 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-28 14:33:53,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 14:33:53,532 WARN L477 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-28 14:33:53,533 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:33:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:33:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-28 14:33:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612759727] [2022-04-28 14:33:53,534 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:33:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-28 14:33:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:33:53,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078366963] [2022-04-28 14:33:53,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:33:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:33:53,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:33:53,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350783803] [2022-04-28 14:33:53,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:33:53,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:33:53,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:33:53,562 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-28 14:33:53,563 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-28 14:33:55,288 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:33:55,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:33:55,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:33:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:33:55,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:33:55,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-28 14:33:55,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#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); {3397#true} is VALID [2022-04-28 14:33:55,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #63#return; {3397#true} is VALID [2022-04-28 14:33:55,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret5 := main(); {3397#true} is VALID [2022-04-28 14:33:55,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#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; {3397#true} is VALID [2022-04-28 14:33:55,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3397#true} is VALID [2022-04-28 14:33:55,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} ~cond := #in~cond; {3423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:33:55,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {3423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:33:55,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:33:55,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} {3397#true} #53#return; {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-28 14:33:55,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3397#true} is VALID [2022-04-28 14:33:55,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3397#true} {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} #55#return; {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-28 14:33:55,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {3434#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:33:55,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:33:55,741 INFO L272 TraceCheckUtils]: 18: Hoare triple {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 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)); {3397#true} is VALID [2022-04-28 14:33:55,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,741 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3397#true} {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #57#return; {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:33:55,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 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; {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:33:55,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:33:55,742 INFO L272 TraceCheckUtils]: 25: Hoare triple {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 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)); {3397#true} is VALID [2022-04-28 14:33:55,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,743 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3397#true} {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #57#return; {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:33:55,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {3475#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 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; {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:33:55,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:33:55,744 INFO L272 TraceCheckUtils]: 32: Hoare triple {3497#(and (<= main_~k~0 5) (<= 0 main_~k~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)); {3397#true} is VALID [2022-04-28 14:33:55,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,745 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3397#true} {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #57#return; {3497#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:33:55,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {3497#(and (<= main_~k~0 5) (<= 0 main_~k~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; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:33:55,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:33:55,746 INFO L272 TraceCheckUtils]: 39: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 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)); {3397#true} is VALID [2022-04-28 14:33:55,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,747 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3397#true} {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #57#return; {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:33:55,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {3519#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 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; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:33:55,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:33:55,748 INFO L272 TraceCheckUtils]: 46: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 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)); {3397#true} is VALID [2022-04-28 14:33:55,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,749 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3397#true} {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #57#return; {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:33:55,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {3541#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 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; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:33:55,750 INFO L290 TraceCheckUtils]: 52: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:33:55,750 INFO L272 TraceCheckUtils]: 53: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 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)); {3397#true} is VALID [2022-04-28 14:33:55,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:55,750 INFO L290 TraceCheckUtils]: 55: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:55,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:55,751 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3397#true} {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #57#return; {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:33:55,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {3563#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 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; {3398#false} is VALID [2022-04-28 14:33:55,751 INFO L290 TraceCheckUtils]: 59: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-28 14:33:55,751 INFO L272 TraceCheckUtils]: 60: Hoare triple {3398#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)); {3398#false} is VALID [2022-04-28 14:33:55,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 62: Hoare triple {3398#false} assume !(0 == ~cond); {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 63: Hoare triple {3398#false} assume true; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3398#false} {3398#false} #57#return; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {3398#false} assume !(~c~0 < ~k~0); {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L272 TraceCheckUtils]: 66: Hoare triple {3398#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)); {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {3398#false} assume !(0 == ~cond); {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {3398#false} assume true; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3398#false} {3398#false} #59#return; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L272 TraceCheckUtils]: 71: Hoare triple {3398#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 72: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 73: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2022-04-28 14:33:55,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-28 14:33:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 14:33:55,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:33:56,122 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-28 14:33:56,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2022-04-28 14:33:56,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2022-04-28 14:33:56,122 INFO L272 TraceCheckUtils]: 71: Hoare triple {3398#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3398#false} is VALID [2022-04-28 14:33:56,122 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3397#true} {3398#false} #59#return; {3398#false} is VALID [2022-04-28 14:33:56,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 68: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 67: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L272 TraceCheckUtils]: 66: Hoare triple {3398#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)); {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {3398#false} assume !(~c~0 < ~k~0); {3398#false} is VALID [2022-04-28 14:33:56,123 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3397#true} {3398#false} #57#return; {3398#false} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 61: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L272 TraceCheckUtils]: 60: Hoare triple {3398#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)); {3397#true} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 59: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-28 14:33:56,123 INFO L290 TraceCheckUtils]: 58: Hoare triple {3681#(not (< main_~c~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; {3398#false} is VALID [2022-04-28 14:33:56,124 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3397#true} {3681#(not (< main_~c~0 main_~k~0))} #57#return; {3681#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 14:33:56,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,124 INFO L272 TraceCheckUtils]: 53: Hoare triple {3681#(not (< main_~c~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)); {3397#true} is VALID [2022-04-28 14:33:56,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {3681#(not (< main_~c~0 main_~k~0))} assume !false; {3681#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 14:33:56,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {3703#(<= main_~k~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; {3681#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 14:33:56,126 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3397#true} {3703#(<= main_~k~0 (+ main_~c~0 1))} #57#return; {3703#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 14:33:56,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,126 INFO L272 TraceCheckUtils]: 46: Hoare triple {3703#(<= 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)); {3397#true} is VALID [2022-04-28 14:33:56,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {3703#(<= main_~k~0 (+ main_~c~0 1))} assume !false; {3703#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 14:33:56,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3703#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 14:33:56,128 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3397#true} {3725#(<= main_~k~0 (+ main_~c~0 2))} #57#return; {3725#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 14:33:56,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,128 INFO L272 TraceCheckUtils]: 39: Hoare triple {3725#(<= main_~k~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)); {3397#true} is VALID [2022-04-28 14:33:56,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {3725#(<= main_~k~0 (+ main_~c~0 2))} assume !false; {3725#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 14:33:56,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {3747#(<= main_~k~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; {3725#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 14:33:56,129 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3397#true} {3747#(<= main_~k~0 (+ main_~c~0 3))} #57#return; {3747#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-28 14:33:56,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,129 INFO L272 TraceCheckUtils]: 32: Hoare triple {3747#(<= main_~k~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)); {3397#true} is VALID [2022-04-28 14:33:56,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {3747#(<= main_~k~0 (+ main_~c~0 3))} assume !false; {3747#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-28 14:33:56,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3747#(<= main_~k~0 (+ main_~c~0 3))} is VALID [2022-04-28 14:33:56,147 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3397#true} {3769#(<= main_~k~0 (+ main_~c~0 4))} #57#return; {3769#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-28 14:33:56,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,148 INFO L272 TraceCheckUtils]: 25: Hoare triple {3769#(<= 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)); {3397#true} is VALID [2022-04-28 14:33:56,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {3769#(<= main_~k~0 (+ main_~c~0 4))} assume !false; {3769#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-28 14:33:56,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {3791#(<= main_~k~0 (+ 5 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; {3769#(<= main_~k~0 (+ main_~c~0 4))} is VALID [2022-04-28 14:33:56,152 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3397#true} {3791#(<= main_~k~0 (+ 5 main_~c~0))} #57#return; {3791#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-28 14:33:56,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,152 INFO L272 TraceCheckUtils]: 18: Hoare triple {3791#(<= main_~k~0 (+ 5 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)); {3397#true} is VALID [2022-04-28 14:33:56,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {3791#(<= main_~k~0 (+ 5 main_~c~0))} assume !false; {3791#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-28 14:33:56,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {3813#(<= main_~k~0 5)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3791#(<= main_~k~0 (+ 5 main_~c~0))} is VALID [2022-04-28 14:33:56,153 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3397#true} {3813#(<= main_~k~0 5)} #55#return; {3813#(<= main_~k~0 5)} is VALID [2022-04-28 14:33:56,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-28 14:33:56,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-28 14:33:56,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {3813#(<= main_~k~0 5)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3397#true} is VALID [2022-04-28 14:33:56,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} {3397#true} #53#return; {3813#(<= main_~k~0 5)} is VALID [2022-04-28 14:33:56,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {3427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:33:56,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {3841#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:33:56,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} ~cond := #in~cond; {3841#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 14:33:56,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3397#true} is VALID [2022-04-28 14:33:56,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#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; {3397#true} is VALID [2022-04-28 14:33:56,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret5 := main(); {3397#true} is VALID [2022-04-28 14:33:56,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #63#return; {3397#true} is VALID [2022-04-28 14:33:56,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-28 14:33:56,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#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); {3397#true} is VALID [2022-04-28 14:33:56,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-28 14:33:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-28 14:33:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:33:56,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078366963] [2022-04-28 14:33:56,155 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:33:56,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350783803] [2022-04-28 14:33:56,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350783803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:33:56,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:33:56,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-28 14:33:56,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:33:56,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612759727] [2022-04-28 14:33:56,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612759727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:33:56,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:33:56,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:33:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270162443] [2022-04-28 14:33:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:33:56,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 14:33:56,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:33:56,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 14:33:56,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:33:56,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:33:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:33:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:33:56,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:33:56,192 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 14:33:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:56,453 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 14:33:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:33:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-28 14:33:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:33:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 14:33:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 14:33:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 14:33:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-28 14:33:56,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-28 14:33:56,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:33:56,499 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:33:56,499 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:33:56,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:33:56,500 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:33:56,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:33:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:33:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:33:56,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:33:56,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:33:56,501 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:33:56,501 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:33:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:56,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:33:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:33:56,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:56,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:56,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:33:56,501 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:33:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:33:56,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:33:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:33:56,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:56,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:33:56,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:33:56,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:33:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:33:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:33:56,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-28 14:33:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:33:56,502 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:33:56,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 9 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-28 14:33:56,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:33:56,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:33:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:33:56,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:33:56,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:33:56,510 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-28 14:33:56,705 WARN L477 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-28 14:33:56,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:33:57,976 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 14:33:57,976 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 14:33:57,976 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 14:33:57,976 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 14:33:57,976 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:33:57,976 INFO L895 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:33:57,976 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:33:57,976 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ 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))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L29-1(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ 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))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ 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))))) (or (and (<= main_~c~0 5) .cse0 .cse1 (= 5 main_~y~0) (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1) (and .cse0 (= main_~y~0 1) .cse1 (< 0 main_~k~0) (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and .cse0 (= main_~y~0 3) .cse1 (< 2 main_~k~0) (= main_~c~0 3)))) [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ 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))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (= main_~y~0 3) .cse0 (<= main_~k~0 3) (< 2 main_~k~0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= 3 .cse1) (< 3 main_~k~0) .cse0 (<= main_~k~0 4) (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)))) [2022-04-28 14:33:57,977 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 42) the Hoare annotation is: true [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-28 14:33:57,977 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-28 14:33:57,977 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 42) the Hoare annotation is: true [2022-04-28 14:33:57,977 INFO L902 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: true [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ 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))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (= main_~y~0 3) .cse0 (<= main_~k~0 3) (< 2 main_~k~0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) .cse0 (< 0 main_~k~0) (<= main_~c~0 1)) (and (= 3 .cse1) (< 3 main_~k~0) .cse0 (<= main_~k~0 4) (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) .cse0 (= 5 main_~y~0) (< 4 main_~k~0)))) [2022-04-28 14:33:57,977 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:33:57,977 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:33:57,977 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:33:57,978 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:33:57,978 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:33:57,978 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:33:57,978 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:33:57,978 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 14:33:57,978 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:33:57,978 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:33:57,978 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:33:57,978 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:33:57,978 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:33:57,980 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2] [2022-04-28 14:33:57,981 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:33:57,983 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:33:57,987 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:33:58,436 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:33:58,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:33:58 BoogieIcfgContainer [2022-04-28 14:33:58,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:33:58,449 INFO L158 Benchmark]: Toolchain (without parser) took 22240.05ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 158.3MB in the beginning and 135.8MB in the end (delta: 22.5MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. [2022-04-28 14:33:58,450 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:33:58,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.47ms. Allocated memory is still 206.6MB. Free memory was 158.1MB in the beginning and 182.3MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:33:58,450 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 206.6MB. Free memory was 182.3MB in the beginning and 180.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:33:58,450 INFO L158 Benchmark]: RCFGBuilder took 240.02ms. Allocated memory is still 206.6MB. Free memory was 180.7MB in the beginning and 169.8MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:33:58,450 INFO L158 Benchmark]: TraceAbstraction took 21785.29ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 169.4MB in the beginning and 135.8MB in the end (delta: 33.6MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. [2022-04-28 14:33:58,451 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 174.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.47ms. Allocated memory is still 206.6MB. Free memory was 158.1MB in the beginning and 182.3MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 206.6MB. Free memory was 182.3MB in the beginning and 180.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 240.02ms. Allocated memory is still 206.6MB. Free memory was 180.7MB in the beginning and 169.8MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21785.29ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 169.4MB in the beginning and 135.8MB in the end (delta: 33.6MB). Peak memory consumption was 76.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 1321 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1036 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 757 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 285 mSDtfsCounter, 757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 515 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 175 PreInvPairs, 256 NumberOfFragments, 1269 HoareAnnotationTreeSize, 175 FomulaSimplifications, 243 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((((c <= 5 && k <= 5) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 5 == y) && 5 <= c) && 4 < k) || ((((k <= 5 && 0 <= k) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && c == 0) && y == 0)) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10)) || ((((k <= 5 && y == 1) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 0 < k) && c == 1)) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10)) || ((((k <= 5 && y == 3) && y + 30 * x == y * y * y * y * 15 + 6 * (y * y * y * y * y) + y * y * y * 10) && 2 < k) && c == 3) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 14:33:58,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...