/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:43:52,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:43:52,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:43:52,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:43:52,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:43:52,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:43:52,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:43:52,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:43:52,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:43:52,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:43:52,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:43:52,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:43:52,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:43:52,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:43:52,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:43:52,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:43:52,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:43:52,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:43:52,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:43:52,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:43:52,280 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:43:52,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:43:52,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:43:52,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:43:52,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:43:52,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:43:52,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:43:52,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:43:52,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:43:52,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:43:52,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:43:52,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:43:52,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:43:52,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:43:52,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:43:52,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:43:52,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:43:52,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:43:52,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:43:52,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:43:52,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:43:52,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:43:52,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:43:52,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:43:52,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:43:52,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:43:52,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:43:52,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:43:52,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:43:52,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:43:52,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:43:52,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:43:52,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:43:52,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:43:52,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:43:52,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:43:52,316 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 07:43:52,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:43:52,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:43:52,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:43:52,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:43:52,535 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:43:52,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-08 07:43:52,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554347028/7f3a17686f004675813aa36c38836168/FLAG05d875635 [2022-04-08 07:43:52,872 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:43:52,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound10.c [2022-04-08 07:43:52,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554347028/7f3a17686f004675813aa36c38836168/FLAG05d875635 [2022-04-08 07:43:53,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554347028/7f3a17686f004675813aa36c38836168 [2022-04-08 07:43:53,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:43:53,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:43:53,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:43:53,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:43:53,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:43:53,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ed7c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53, skipping insertion in model container [2022-04-08 07:43:53,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:43:53,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:43:53,460 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/ps4-ll_unwindbound10.c[458,471] [2022-04-08 07:43:53,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:43:53,490 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:43:53,504 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/ps4-ll_unwindbound10.c[458,471] [2022-04-08 07:43:53,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:43:53,535 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:43:53,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53 WrapperNode [2022-04-08 07:43:53,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:43:53,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:43:53,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:43:53,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:43:53,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:43:53,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:43:53,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:43:53,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:43:53,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (1/1) ... [2022-04-08 07:43:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:43:53,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:53,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 07:43:53,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 07:43:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:43:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:43:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:43:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:43:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:43:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:43:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:43:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:43:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:43:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:43:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 07:43:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:43:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:43:53,706 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:43:53,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:43:53,804 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:43:53,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:43:53,810 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:43:53,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:43:53 BoogieIcfgContainer [2022-04-08 07:43:53,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:43:53,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:43:53,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:43:53,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:43:53,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:43:53" (1/3) ... [2022-04-08 07:43:53,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c724dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:43:53, skipping insertion in model container [2022-04-08 07:43:53,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:43:53" (2/3) ... [2022-04-08 07:43:53,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c724dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:43:53, skipping insertion in model container [2022-04-08 07:43:53,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:43:53" (3/3) ... [2022-04-08 07:43:53,819 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2022-04-08 07:43:53,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:43:53,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:43:53,899 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:43:53,904 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 07:43:53,904 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:43:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:43:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 07:43:53,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:53,948 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:53,949 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-08 07:43:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:53,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326483414] [2022-04-08 07:43:53,978 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:43:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times [2022-04-08 07:43:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:53,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921349474] [2022-04-08 07:43:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:43:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:54,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-08 07:43:54,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 07:43:54,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-08 07:43:54,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:43:54,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-08 07:43:54,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 07:43:54,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-08 07:43:54,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-08 07:43:54,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-08 07:43:54,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 07:43:54,191 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-08 07:43:54,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 07:43:54,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 07:43:54,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 07:43:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:54,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921349474] [2022-04-08 07:43:54,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921349474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:54,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:54,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:43:54,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326483414] [2022-04-08 07:43:54,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326483414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:54,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:54,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:43:54,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63655211] [2022-04-08 07:43:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:54,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 07:43:54,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:54,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:54,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:43:54,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:43:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:43:54,248 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,347 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-08 07:43:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:43:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 07:43:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 07:43:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 07:43:54,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 07:43:54,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:54,470 INFO L225 Difference]: With dead ends: 41 [2022-04-08 07:43:54,470 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 07:43:54,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:43:54,475 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:54,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 07:43:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 07:43:54,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:54,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,501 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,501 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,505 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 07:43:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 07:43:54,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:54,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:54,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-08 07:43:54,506 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-08 07:43:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,509 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 07:43:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 07:43:54,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:54,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:54,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:54,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 07:43:54,514 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-08 07:43:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:54,514 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 07:43:54,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-08 07:43:54,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 07:43:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 07:43:54,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:54,537 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:54,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:43:54,537 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-08 07:43:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:54,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970805957] [2022-04-08 07:43:54,539 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:43:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times [2022-04-08 07:43:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:54,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194603100] [2022-04-08 07:43:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:54,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:54,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297557521] [2022-04-08 07:43:54,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:43:54,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:54,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:43:54,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 07:43:54,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:43:54,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:54,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 07:43:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:54,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:54,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-08 07:43:54,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {198#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {198#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {214#(<= |main_#t~post5| 0)} is VALID [2022-04-08 07:43:54,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {191#false} is VALID [2022-04-08 07:43:54,725 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {191#false} is VALID [2022-04-08 07:43:54,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-08 07:43:54,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-08 07:43:54,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-08 07:43:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:54,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:43:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194603100] [2022-04-08 07:43:54,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:54,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297557521] [2022-04-08 07:43:54,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297557521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:54,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:54,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:43:54,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970805957] [2022-04-08 07:43:54,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970805957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:54,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:54,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:43:54,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356293141] [2022-04-08 07:43:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:54,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 07:43:54,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:54,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:54,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 07:43:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 07:43:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 07:43:54,741 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,790 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 07:43:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 07:43:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 07:43:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 07:43:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 07:43:54,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-08 07:43:54,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:54,824 INFO L225 Difference]: With dead ends: 28 [2022-04-08 07:43:54,824 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 07:43:54,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 07:43:54,826 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:54,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 07:43:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 07:43:54,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:54,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,835 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,836 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,837 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 07:43:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 07:43:54,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:54,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:54,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 07:43:54,839 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-08 07:43:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,841 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 07:43:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 07:43:54,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:54,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:54,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:54,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 07:43:54,843 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-08 07:43:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:54,843 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 07:43:54,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:54,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-08 07:43:54,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 07:43:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 07:43:54,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:54,867 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:54,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 07:43:55,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:55,094 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-08 07:43:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:55,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368806842] [2022-04-08 07:43:55,097 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:43:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times [2022-04-08 07:43:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:55,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234892435] [2022-04-08 07:43:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:55,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:55,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944335816] [2022-04-08 07:43:55,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:43:55,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:55,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:43:55,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 07:43:55,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:43:55,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:55,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:43:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:55,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:55,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2022-04-08 07:43:55,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {365#true} is VALID [2022-04-08 07:43:55,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2022-04-08 07:43:55,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID [2022-04-08 07:43:55,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID [2022-04-08 07:43:55,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:55,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:55,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:55,327 INFO L272 TraceCheckUtils]: 8: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {395#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:43:55,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:55,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-04-08 07:43:55,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-04-08 07:43:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:55,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:43:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234892435] [2022-04-08 07:43:55,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944335816] [2022-04-08 07:43:55,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944335816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:55,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:55,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:43:55,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368806842] [2022-04-08 07:43:55,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368806842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:55,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:55,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:43:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027563543] [2022-04-08 07:43:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:55,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 07:43:55,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:55,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:55,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:55,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:43:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:43:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:43:55,342 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:55,471 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 07:43:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:43:55,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 07:43:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 07:43:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 07:43:55,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 07:43:55,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:55,543 INFO L225 Difference]: With dead ends: 30 [2022-04-08 07:43:55,543 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 07:43:55,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:43:55,545 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:55,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 07:43:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 07:43:55,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:55,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:55,569 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:55,569 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:55,571 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:43:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:43:55,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:55,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:55,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 07:43:55,573 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 07:43:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:55,575 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:43:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:43:55,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:55,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:55,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:55,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 07:43:55,577 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-08 07:43:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:55,578 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 07:43:55,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 07:43:55,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 07:43:55,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:43:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 07:43:55,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:55,606 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:55,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 07:43:55,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 07:43:55,828 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-08 07:43:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:55,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294636415] [2022-04-08 07:43:56,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:43:56,004 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:43:56,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:43:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times [2022-04-08 07:43:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:56,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766448909] [2022-04-08 07:43:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:56,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:56,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013479166] [2022-04-08 07:43:56,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:43:56,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:56,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:56,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:43:56,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 07:43:56,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:43:56,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:56,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:43:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:56,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:56,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-08 07:43:56,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {579#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:56,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:56,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:56,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:56,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {579#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:56,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,241 INFO L272 TraceCheckUtils]: 8: Hoare triple {595#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,244 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {595#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:56,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {620#(<= |main_#t~post5| 1)} is VALID [2022-04-08 07:43:56,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {572#false} is VALID [2022-04-08 07:43:56,245 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID [2022-04-08 07:43:56,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-08 07:43:56,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-08 07:43:56,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-08 07:43:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:56,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:43:56,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-08 07:43:56,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-08 07:43:56,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-08 07:43:56,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID [2022-04-08 07:43:56,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {572#false} is VALID [2022-04-08 07:43:56,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {648#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:43:56,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {652#(< ~counter~0 10)} is VALID [2022-04-08 07:43:56,420 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 10)} #51#return; {652#(< ~counter~0 10)} is VALID [2022-04-08 07:43:56,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-08 07:43:56,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-08 07:43:56,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-08 07:43:56,420 INFO L272 TraceCheckUtils]: 8: Hoare triple {652#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {571#true} is VALID [2022-04-08 07:43:56,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {652#(< ~counter~0 10)} is VALID [2022-04-08 07:43:56,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {652#(< ~counter~0 10)} is VALID [2022-04-08 07:43:56,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(< ~counter~0 9)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {677#(< ~counter~0 9)} is VALID [2022-04-08 07:43:56,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 9)} call #t~ret6 := main(); {677#(< ~counter~0 9)} is VALID [2022-04-08 07:43:56,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 9)} {571#true} #57#return; {677#(< ~counter~0 9)} is VALID [2022-04-08 07:43:56,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 9)} assume true; {677#(< ~counter~0 9)} is VALID [2022-04-08 07:43:56,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {677#(< ~counter~0 9)} is VALID [2022-04-08 07:43:56,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-08 07:43:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:56,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766448909] [2022-04-08 07:43:56,425 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:56,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013479166] [2022-04-08 07:43:56,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013479166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:43:56,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:43:56,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 07:43:56,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:56,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294636415] [2022-04-08 07:43:56,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294636415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:56,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:56,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:43:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084265140] [2022-04-08 07:43:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:56,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 07:43:56,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:56,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:56,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:56,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:43:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:43:56,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:43:56,445 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:56,546 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-08 07:43:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 07:43:56,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 07:43:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 07:43:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 07:43:56,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 07:43:56,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:56,590 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:43:56,590 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 07:43:56,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 07:43:56,592 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:56,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 07:43:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 07:43:56,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:56,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:56,611 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:56,611 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:56,613 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 07:43:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 07:43:56,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:56,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:56,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 07:43:56,614 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 07:43:56,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:56,616 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 07:43:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 07:43:56,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:56,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:56,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:56,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-08 07:43:56,618 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-08 07:43:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:56,618 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-08 07:43:56,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:56,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-08 07:43:56,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 07:43:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 07:43:56,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:56,648 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:56,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 07:43:56,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:56,851 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-08 07:43:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:56,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171355722] [2022-04-08 07:43:56,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:43:56,991 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:43:56,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:43:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times [2022-04-08 07:43:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:56,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453674520] [2022-04-08 07:43:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:57,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:57,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122361689] [2022-04-08 07:43:57,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:43:57,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:57,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:43:57,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 07:43:57,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:43:57,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:57,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:43:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:57,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:57,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-08 07:43:57,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {884#true} is VALID [2022-04-08 07:43:57,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 07:43:57,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-08 07:43:57,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-08 07:43:57,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:57,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:57,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:57,167 INFO L272 TraceCheckUtils]: 8: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID [2022-04-08 07:43:57,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-08 07:43:57,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-08 07:43:57,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 07:43:57,168 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {904#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:57,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {904#(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 + ~x~0; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:43:57,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:43:57,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !!(#t~post5 < 10);havoc #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 07:43:57,170 INFO L272 TraceCheckUtils]: 16: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:43:57,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:57,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-08 07:43:57,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-08 07:43:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:57,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:43:57,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-08 07:43:57,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-08 07:43:57,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:57,389 INFO L272 TraceCheckUtils]: 16: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:43:57,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~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 + ~x~0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,402 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 07:43:57,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-08 07:43:57,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-08 07:43:57,403 INFO L272 TraceCheckUtils]: 8: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID [2022-04-08 07:43:57,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-08 07:43:57,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-08 07:43:57,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-08 07:43:57,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 07:43:57,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {884#true} is VALID [2022-04-08 07:43:57,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-08 07:43:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 07:43:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:57,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453674520] [2022-04-08 07:43:57,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:57,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122361689] [2022-04-08 07:43:57,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122361689] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:43:57,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:43:57,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 07:43:57,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:57,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171355722] [2022-04-08 07:43:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171355722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:57,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:57,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:43:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039812754] [2022-04-08 07:43:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 07:43:57,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:57,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:57,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:57,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:43:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:57,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:43:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 07:43:57,432 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:57,576 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 07:43:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:43:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 07:43:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 07:43:57,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 07:43:57,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-08 07:43:57,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:57,617 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:43:57,617 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 07:43:57,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:43:57,618 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:57,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 07:43:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 07:43:57,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:57,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:57,644 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:57,644 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:57,645 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 07:43:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 07:43:57,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:57,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:57,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 07:43:57,646 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-08 07:43:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:57,647 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 07:43:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 07:43:57,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:57,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:57,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:57,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 07:43:57,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-08 07:43:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:57,649 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 07:43:57,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 07:43:57,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-08 07:43:57,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 07:43:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 07:43:57,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:57,690 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:57,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 07:43:57,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:57,891 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:57,891 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-08 07:43:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:57,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [56976335] [2022-04-08 07:43:58,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:43:58,009 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:43:58,010 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:43:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times [2022-04-08 07:43:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:58,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765869790] [2022-04-08 07:43:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:58,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:58,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96663724] [2022-04-08 07:43:58,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:43:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:58,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:58,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:43:58,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 07:43:58,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:43:58,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:58,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 07:43:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:58,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:58,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-08 07:43:58,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1196#true} is VALID [2022-04-08 07:43:58,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 07:43:58,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID [2022-04-08 07:43:58,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID [2022-04-08 07:43:58,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {1196#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:58,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:58,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:58,354 INFO L272 TraceCheckUtils]: 8: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID [2022-04-08 07:43:58,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-08 07:43:58,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-08 07:43:58,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 07:43:58,362 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1196#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:43:58,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#(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 + ~x~0; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:43:58,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:43:58,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:43:58,364 INFO L272 TraceCheckUtils]: 16: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID [2022-04-08 07:43:58,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-08 07:43:58,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-08 07:43:58,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 07:43:58,365 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1196#true} {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 07:43:58,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 07:43:58,366 INFO L272 TraceCheckUtils]: 22: Hoare triple {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:43:58,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:58,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-08 07:43:58,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-08 07:43:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:43:58,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:43:58,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:58,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765869790] [2022-04-08 07:43:58,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:58,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96663724] [2022-04-08 07:43:58,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96663724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:43:58,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:43:58,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 07:43:58,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:58,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [56976335] [2022-04-08 07:43:58,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [56976335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:58,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:58,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:43:58,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951897231] [2022-04-08 07:43:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 07:43:58,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:58,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:58,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:58,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:43:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:58,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:43:58,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:43:58,752 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:58,927 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 07:43:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 07:43:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-08 07:43:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 07:43:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 07:43:58,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 07:43:58,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:58,961 INFO L225 Difference]: With dead ends: 36 [2022-04-08 07:43:58,961 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 07:43:58,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:43:58,962 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:58,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 07:43:58,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 07:43:58,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:58,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:58,985 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:58,985 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:58,986 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 07:43:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 07:43:58,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:58,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:58,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:43:58,987 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-08 07:43:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:58,988 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 07:43:58,988 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 07:43:58,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:58,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:58,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:58,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:43:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 07:43:58,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-08 07:43:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:58,993 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 07:43:58,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:58,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 07:43:59,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 07:43:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:43:59,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:59,041 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:59,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 07:43:59,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:59,241 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times [2022-04-08 07:43:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:59,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [623769648] [2022-04-08 07:43:59,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:43:59,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:43:59,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:43:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times [2022-04-08 07:43:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:59,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434856018] [2022-04-08 07:43:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:59,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156123043] [2022-04-08 07:43:59,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:43:59,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:59,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:59,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:43:59,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 07:43:59,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:43:59,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:59,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 07:43:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:59,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:59,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-08 07:43:59,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:59,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:59,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:59,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:59,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1533#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:59,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,592 INFO L272 TraceCheckUtils]: 8: Hoare triple {1549#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,594 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(<= ~counter~0 1)} {1549#(<= ~counter~0 1)} #51#return; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {1549#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:59,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,596 INFO L272 TraceCheckUtils]: 16: Hoare triple {1574#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,597 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1574#(<= ~counter~0 2)} {1574#(<= ~counter~0 2)} #51#return; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:59,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1599#(<= |main_#t~post5| 2)} is VALID [2022-04-08 07:43:59,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1526#false} is VALID [2022-04-08 07:43:59,598 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID [2022-04-08 07:43:59,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-08 07:43:59,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-08 07:43:59,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-08 07:43:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:43:59,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:43:59,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-08 07:43:59,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-08 07:43:59,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-08 07:43:59,806 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID [2022-04-08 07:43:59,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1526#false} is VALID [2022-04-08 07:43:59,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1627#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:43:59,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1631#(< ~counter~0 10)} is VALID [2022-04-08 07:43:59,809 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 10)} #51#return; {1631#(< ~counter~0 10)} is VALID [2022-04-08 07:43:59,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-08 07:43:59,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-08 07:43:59,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-08 07:43:59,809 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID [2022-04-08 07:43:59,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1631#(< ~counter~0 10)} is VALID [2022-04-08 07:43:59,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1631#(< ~counter~0 10)} is VALID [2022-04-08 07:43:59,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {1656#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1656#(< ~counter~0 9)} is VALID [2022-04-08 07:43:59,811 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 9)} #51#return; {1656#(< ~counter~0 9)} is VALID [2022-04-08 07:43:59,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-08 07:43:59,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-08 07:43:59,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-08 07:43:59,812 INFO L272 TraceCheckUtils]: 8: Hoare triple {1656#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID [2022-04-08 07:43:59,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {1656#(< ~counter~0 9)} is VALID [2022-04-08 07:43:59,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1656#(< ~counter~0 9)} is VALID [2022-04-08 07:43:59,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1681#(< ~counter~0 8)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1681#(< ~counter~0 8)} is VALID [2022-04-08 07:43:59,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 8)} call #t~ret6 := main(); {1681#(< ~counter~0 8)} is VALID [2022-04-08 07:43:59,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 8)} {1525#true} #57#return; {1681#(< ~counter~0 8)} is VALID [2022-04-08 07:43:59,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 8)} assume true; {1681#(< ~counter~0 8)} is VALID [2022-04-08 07:43:59,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1681#(< ~counter~0 8)} is VALID [2022-04-08 07:43:59,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-08 07:43:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 07:43:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:59,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434856018] [2022-04-08 07:43:59,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:59,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156123043] [2022-04-08 07:43:59,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156123043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:43:59,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:43:59,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 07:43:59,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:59,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [623769648] [2022-04-08 07:43:59,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [623769648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:59,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:59,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:43:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006591528] [2022-04-08 07:43:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-08 07:43:59,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:59,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:59,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:59,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 07:43:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 07:43:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:43:59,842 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:59,957 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-08 07:43:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:43:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-08 07:43:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 07:43:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:43:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 07:43:59,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 07:43:59,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:59,992 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:43:59,992 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 07:43:59,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:43:59,993 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:59,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 07:44:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 07:44:00,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:00,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:00,030 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:00,030 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:00,031 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 07:44:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 07:44:00,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:00,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:00,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 07:44:00,032 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 07:44:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:00,033 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 07:44:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 07:44:00,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:00,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:00,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:00,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-08 07:44:00,035 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-08 07:44:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:00,035 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-08 07:44:00,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 07:44:00,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-08 07:44:00,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 07:44:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 07:44:00,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:00,089 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:00,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:00,289 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:00,290 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times [2022-04-08 07:44:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:00,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [746889326] [2022-04-08 07:44:00,387 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:00,387 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:00,387 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times [2022-04-08 07:44:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22012521] [2022-04-08 07:44:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:00,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:00,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479763693] [2022-04-08 07:44:00,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:00,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:00,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:00,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 07:44:00,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:00,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:00,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 07:44:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:00,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:00,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2022-04-08 07:44:00,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1938#true} is VALID [2022-04-08 07:44:00,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 07:44:00,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID [2022-04-08 07:44:00,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID [2022-04-08 07:44:00,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {1938#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:00,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:00,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:00,804 INFO L272 TraceCheckUtils]: 8: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-08 07:44:00,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 07:44:00,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 07:44:00,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 07:44:00,805 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1938#true} {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:00,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1958#(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 + ~x~0; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:00,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:00,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:00,806 INFO L272 TraceCheckUtils]: 16: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-08 07:44:00,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 07:44:00,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 07:44:00,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 07:44:00,807 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1938#true} {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:00,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 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 + ~x~0; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:00,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:00,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:00,809 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-08 07:44:00,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 07:44:00,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 07:44:00,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 07:44:00,810 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1938#true} {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #51#return; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 07:44:00,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 07:44:00,812 INFO L272 TraceCheckUtils]: 30: Hoare triple {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:00,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:00,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID [2022-04-08 07:44:00,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2022-04-08 07:44:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:44:00,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:01,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22012521] [2022-04-08 07:44:01,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:01,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479763693] [2022-04-08 07:44:01,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479763693] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:01,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:01,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 07:44:01,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [746889326] [2022-04-08 07:44:01,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [746889326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:01,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:01,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:44:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649455050] [2022-04-08 07:44:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:01,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-08 07:44:01,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:01,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:01,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:01,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:44:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:44:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:44:01,246 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:01,516 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 07:44:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:44:01,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-08 07:44:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 07:44:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 07:44:01,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 07:44:01,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:01,557 INFO L225 Difference]: With dead ends: 44 [2022-04-08 07:44:01,557 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 07:44:01,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 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-08 07:44:01,558 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:01,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:44:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 07:44:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 07:44:01,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:01,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:01,601 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:01,601 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:01,603 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 07:44:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 07:44:01,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:01,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:01,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-08 07:44:01,604 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-08 07:44:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:01,605 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 07:44:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 07:44:01,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:01,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:01,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:01,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-08 07:44:01,607 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2022-04-08 07:44:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:01,608 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-08 07:44:01,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:01,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-08 07:44:01,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 07:44:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 07:44:01,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:01,660 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:01,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:01,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:01,867 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times [2022-04-08 07:44:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:01,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620933085] [2022-04-08 07:44:01,978 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:01,978 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:01,978 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times [2022-04-08 07:44:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758925034] [2022-04-08 07:44:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:01,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:01,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744803689] [2022-04-08 07:44:01,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:01,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:01,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:01,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:02,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 07:44:02,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:44:02,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:02,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:44:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:02,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:02,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-08 07:44:02,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:02,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:02,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:02,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:02,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:02,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {2389#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,260 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2389#(<= ~counter~0 1)} {2389#(<= ~counter~0 1)} #51#return; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {2389#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:02,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {2389#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {2414#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,267 INFO L272 TraceCheckUtils]: 16: Hoare triple {2414#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,277 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2414#(<= ~counter~0 2)} {2414#(<= ~counter~0 2)} #51#return; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {2414#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:02,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {2414#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {2439#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,283 INFO L272 TraceCheckUtils]: 24: Hoare triple {2439#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,288 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2439#(<= ~counter~0 3)} {2439#(<= ~counter~0 3)} #51#return; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {2439#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:02,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {2439#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2464#(<= |main_#t~post5| 3)} is VALID [2022-04-08 07:44:02,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2366#false} is VALID [2022-04-08 07:44:02,290 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID [2022-04-08 07:44:02,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-08 07:44:02,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-08 07:44:02,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-08 07:44:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:02,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:02,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-08 07:44:02,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-08 07:44:02,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-08 07:44:02,551 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID [2022-04-08 07:44:02,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2366#false} is VALID [2022-04-08 07:44:02,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2492#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:44:02,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {2496#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2496#(< ~counter~0 10)} is VALID [2022-04-08 07:44:02,552 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 10)} #51#return; {2496#(< ~counter~0 10)} is VALID [2022-04-08 07:44:02,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 07:44:02,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 07:44:02,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 07:44:02,553 INFO L272 TraceCheckUtils]: 24: Hoare triple {2496#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-08 07:44:02,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2496#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2496#(< ~counter~0 10)} is VALID [2022-04-08 07:44:02,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2496#(< ~counter~0 10)} is VALID [2022-04-08 07:44:02,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2521#(< ~counter~0 9)} is VALID [2022-04-08 07:44:02,555 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 9)} #51#return; {2521#(< ~counter~0 9)} is VALID [2022-04-08 07:44:02,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 07:44:02,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 07:44:02,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 07:44:02,555 INFO L272 TraceCheckUtils]: 16: Hoare triple {2521#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-08 07:44:02,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {2521#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2521#(< ~counter~0 9)} is VALID [2022-04-08 07:44:02,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2521#(< ~counter~0 9)} is VALID [2022-04-08 07:44:02,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2546#(< ~counter~0 8)} is VALID [2022-04-08 07:44:02,557 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 8)} #51#return; {2546#(< ~counter~0 8)} is VALID [2022-04-08 07:44:02,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 07:44:02,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 07:44:02,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 07:44:02,557 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-08 07:44:02,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {2546#(< ~counter~0 8)} is VALID [2022-04-08 07:44:02,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {2571#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2546#(< ~counter~0 8)} is VALID [2022-04-08 07:44:02,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {2571#(< ~counter~0 7)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2571#(< ~counter~0 7)} is VALID [2022-04-08 07:44:02,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 7)} call #t~ret6 := main(); {2571#(< ~counter~0 7)} is VALID [2022-04-08 07:44:02,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 7)} {2365#true} #57#return; {2571#(< ~counter~0 7)} is VALID [2022-04-08 07:44:02,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 7)} assume true; {2571#(< ~counter~0 7)} is VALID [2022-04-08 07:44:02,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2571#(< ~counter~0 7)} is VALID [2022-04-08 07:44:02,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-08 07:44:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:44:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:02,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758925034] [2022-04-08 07:44:02,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:02,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744803689] [2022-04-08 07:44:02,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744803689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:02,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:02,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 07:44:02,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:02,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620933085] [2022-04-08 07:44:02,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620933085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:02,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:02,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:44:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818023794] [2022-04-08 07:44:02,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:02,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 07:44:02,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:02,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:02,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:02,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:44:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:44:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:44:02,591 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:02,755 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 07:44:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:44:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 07:44:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 07:44:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 07:44:02,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-08 07:44:02,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:02,797 INFO L225 Difference]: With dead ends: 50 [2022-04-08 07:44:02,797 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 07:44:02,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:44:02,798 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:02,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 07:44:02,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 07:44:02,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:02,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:02,851 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:02,851 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:02,852 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 07:44:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 07:44:02,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:02,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:02,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-08 07:44:02,853 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-08 07:44:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:02,861 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 07:44:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 07:44:02,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:02,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:02,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:02,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-08 07:44:02,862 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2022-04-08 07:44:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:02,863 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-08 07:44:02,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 07:44:02,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-08 07:44:02,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 07:44:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 07:44:02,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:02,922 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:02,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:03,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 07:44:03,123 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times [2022-04-08 07:44:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:03,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797700763] [2022-04-08 07:44:03,220 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:03,220 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:03,220 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times [2022-04-08 07:44:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:03,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637964294] [2022-04-08 07:44:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:03,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:03,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240924874] [2022-04-08 07:44:03,230 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:03,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:03,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:03,231 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:03,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 07:44:03,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:44:03,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:03,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 07:44:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:03,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:03,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-08 07:44:03,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2878#true} is VALID [2022-04-08 07:44:03,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 07:44:03,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID [2022-04-08 07:44:03,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-08 07:44:03,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:03,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:03,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:03,719 INFO L272 TraceCheckUtils]: 8: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 07:44:03,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 07:44:03,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 07:44:03,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 07:44:03,720 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2878#true} {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:03,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {2898#(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 + ~x~0; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:03,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:03,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:03,722 INFO L272 TraceCheckUtils]: 16: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 07:44:03,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 07:44:03,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 07:44:03,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 07:44:03,722 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2878#true} {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:03,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {2923#(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 + ~x~0; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:03,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:03,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:03,729 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 07:44:03,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 07:44:03,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 07:44:03,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 07:44:03,730 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2878#true} {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 07:44:03,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:03,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:03,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:03,731 INFO L272 TraceCheckUtils]: 32: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-08 07:44:03,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 07:44:03,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 07:44:03,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 07:44:03,732 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2878#true} {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #51#return; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:03,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 07:44:03,733 INFO L272 TraceCheckUtils]: 38: Hoare triple {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:03,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3006#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:03,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-08 07:44:03,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-08 07:44:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 07:44:03,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:04,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:04,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637964294] [2022-04-08 07:44:04,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:04,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240924874] [2022-04-08 07:44:04,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240924874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:04,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:04,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 07:44:04,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:04,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797700763] [2022-04-08 07:44:04,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797700763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:04,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:04,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:44:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805731971] [2022-04-08 07:44:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:04,007 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-08 07:44:04,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:04,008 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:04,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:04,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:44:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:44:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:44:04,039 INFO L87 Difference]: Start difference. First operand 45 states and 46 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:04,386 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 07:44:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 07:44:04,387 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-08 07:44:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:04,387 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:44:04,388 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 07:44:04,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 07:44:04,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:04,430 INFO L225 Difference]: With dead ends: 52 [2022-04-08 07:44:04,430 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 07:44:04,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:04,430 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:04,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:44:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 07:44:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 07:44:04,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:04,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:04,486 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:04,486 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:04,487 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 07:44:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 07:44:04,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:04,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:04,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-08 07:44:04,488 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-08 07:44:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:04,489 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 07:44:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 07:44:04,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:04,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:04,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:04,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-08 07:44:04,490 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-08 07:44:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:04,491 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-08 07:44:04,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:04,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-08 07:44:04,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 07:44:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 07:44:04,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:04,559 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:04,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:04,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 07:44:04,759 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times [2022-04-08 07:44:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:04,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [257032830] [2022-04-08 07:44:04,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:04,846 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:04,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times [2022-04-08 07:44:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:04,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70481014] [2022-04-08 07:44:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:04,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:04,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302492023] [2022-04-08 07:44:04,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:04,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 07:44:04,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:04,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:04,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 07:44:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:04,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:05,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-08 07:44:05,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:05,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:05,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:05,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:05,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {3361#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:05,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {3377#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,187 INFO L272 TraceCheckUtils]: 8: Hoare triple {3377#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,188 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3377#(<= ~counter~0 1)} {3377#(<= ~counter~0 1)} #51#return; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {3377#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:05,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {3377#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,191 INFO L272 TraceCheckUtils]: 16: Hoare triple {3402#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,192 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3402#(<= ~counter~0 2)} {3402#(<= ~counter~0 2)} #51#return; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {3402#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:05,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {3402#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,194 INFO L272 TraceCheckUtils]: 24: Hoare triple {3427#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,196 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3427#(<= ~counter~0 3)} {3427#(<= ~counter~0 3)} #51#return; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {3427#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:05,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {3427#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,202 INFO L272 TraceCheckUtils]: 32: Hoare triple {3452#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,203 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3452#(<= ~counter~0 4)} {3452#(<= ~counter~0 4)} #51#return; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:05,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {3452#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3477#(<= |main_#t~post5| 4)} is VALID [2022-04-08 07:44:05,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {3354#false} is VALID [2022-04-08 07:44:05,205 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID [2022-04-08 07:44:05,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-08 07:44:05,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-08 07:44:05,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-08 07:44:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:05,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:05,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-08 07:44:05,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-08 07:44:05,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-08 07:44:05,478 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID [2022-04-08 07:44:05,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {3354#false} is VALID [2022-04-08 07:44:05,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3505#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:44:05,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3509#(< ~counter~0 10)} is VALID [2022-04-08 07:44:05,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 10)} #51#return; {3509#(< ~counter~0 10)} is VALID [2022-04-08 07:44:05,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 07:44:05,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 07:44:05,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 07:44:05,480 INFO L272 TraceCheckUtils]: 32: Hoare triple {3509#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 07:44:05,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3509#(< ~counter~0 10)} is VALID [2022-04-08 07:44:05,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {3534#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3509#(< ~counter~0 10)} is VALID [2022-04-08 07:44:05,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {3534#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3534#(< ~counter~0 9)} is VALID [2022-04-08 07:44:05,482 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 9)} #51#return; {3534#(< ~counter~0 9)} is VALID [2022-04-08 07:44:05,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 07:44:05,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 07:44:05,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 07:44:05,483 INFO L272 TraceCheckUtils]: 24: Hoare triple {3534#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 07:44:05,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3534#(< ~counter~0 9)} is VALID [2022-04-08 07:44:05,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3534#(< ~counter~0 9)} is VALID [2022-04-08 07:44:05,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3559#(< ~counter~0 8)} is VALID [2022-04-08 07:44:05,485 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 8)} #51#return; {3559#(< ~counter~0 8)} is VALID [2022-04-08 07:44:05,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 07:44:05,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 07:44:05,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 07:44:05,485 INFO L272 TraceCheckUtils]: 16: Hoare triple {3559#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 07:44:05,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3559#(< ~counter~0 8)} is VALID [2022-04-08 07:44:05,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3559#(< ~counter~0 8)} is VALID [2022-04-08 07:44:05,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {3584#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3584#(< ~counter~0 7)} is VALID [2022-04-08 07:44:05,487 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 7)} #51#return; {3584#(< ~counter~0 7)} is VALID [2022-04-08 07:44:05,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 07:44:05,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 07:44:05,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 07:44:05,488 INFO L272 TraceCheckUtils]: 8: Hoare triple {3584#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-08 07:44:05,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {3584#(< ~counter~0 7)} is VALID [2022-04-08 07:44:05,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3584#(< ~counter~0 7)} is VALID [2022-04-08 07:44:05,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(< ~counter~0 6)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3609#(< ~counter~0 6)} is VALID [2022-04-08 07:44:05,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 6)} call #t~ret6 := main(); {3609#(< ~counter~0 6)} is VALID [2022-04-08 07:44:05,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 6)} {3353#true} #57#return; {3609#(< ~counter~0 6)} is VALID [2022-04-08 07:44:05,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 6)} assume true; {3609#(< ~counter~0 6)} is VALID [2022-04-08 07:44:05,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3609#(< ~counter~0 6)} is VALID [2022-04-08 07:44:05,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-08 07:44:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 07:44:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:05,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70481014] [2022-04-08 07:44:05,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:05,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302492023] [2022-04-08 07:44:05,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302492023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:05,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 07:44:05,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [257032830] [2022-04-08 07:44:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [257032830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:05,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:44:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178234489] [2022-04-08 07:44:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44 [2022-04-08 07:44:05,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:05,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:05,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:05,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:44:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:44:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:05,560 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:05,750 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-08 07:44:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:44:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44 [2022-04-08 07:44:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-08 07:44:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-08 07:44:05,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-08 07:44:05,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:05,806 INFO L225 Difference]: With dead ends: 58 [2022-04-08 07:44:05,806 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 07:44:05,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:44:05,807 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:05,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 07:44:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 07:44:05,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:05,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:05,907 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:05,907 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:05,909 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 07:44:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 07:44:05,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:05,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:05,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-08 07:44:05,909 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-08 07:44:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:05,910 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 07:44:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 07:44:05,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:05,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:05,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:05,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-08 07:44:05,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-08 07:44:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:05,914 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-08 07:44:05,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:44:05,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-08 07:44:05,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 07:44:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 07:44:05,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:05,984 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:06,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 07:44:06,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 07:44:06,185 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times [2022-04-08 07:44:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:06,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919266081] [2022-04-08 07:44:06,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:06,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:06,277 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times [2022-04-08 07:44:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974361872] [2022-04-08 07:44:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:06,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:06,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417535791] [2022-04-08 07:44:06,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:06,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:06,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:06,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 07:44:06,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:06,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:06,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:44:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:06,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:06,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-08 07:44:06,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {3966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3966#true} is VALID [2022-04-08 07:44:06,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 07:44:06,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID [2022-04-08 07:44:06,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID [2022-04-08 07:44:06,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {3966#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:06,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:06,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:06,775 INFO L272 TraceCheckUtils]: 8: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 07:44:06,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 07:44:06,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 07:44:06,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 07:44:06,776 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3966#true} {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:06,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {3986#(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 + ~x~0; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:06,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:06,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:06,777 INFO L272 TraceCheckUtils]: 16: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 07:44:06,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 07:44:06,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 07:44:06,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 07:44:06,778 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3966#true} {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:06,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {4011#(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 + ~x~0; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,779 INFO L272 TraceCheckUtils]: 24: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 07:44:06,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 07:44:06,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 07:44:06,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 07:44:06,780 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3966#true} {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {4036#(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 + ~x~0; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,781 INFO L272 TraceCheckUtils]: 32: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 07:44:06,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 07:44:06,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 07:44:06,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 07:44:06,782 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3966#true} {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #51#return; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 07:44:06,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) 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 + ~x~0; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:06,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:06,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:06,783 INFO L272 TraceCheckUtils]: 40: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-08 07:44:06,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 07:44:06,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 07:44:06,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 07:44:06,784 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3966#true} {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #51#return; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 07:44:06,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:06,785 INFO L272 TraceCheckUtils]: 46: Hoare triple {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:06,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:06,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID [2022-04-08 07:44:06,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-08 07:44:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 07:44:06,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974361872] [2022-04-08 07:44:07,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417535791] [2022-04-08 07:44:07,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417535791] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:07,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 07:44:07,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:07,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919266081] [2022-04-08 07:44:07,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919266081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:07,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:44:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925716737] [2022-04-08 07:44:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-08 07:44:07,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:07,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:07,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:07,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:44:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:44:07,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 07:44:07,209 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:07,652 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 07:44:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:44:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-08 07:44:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 07:44:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 07:44:07,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-08 07:44:07,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:07,699 INFO L225 Difference]: With dead ends: 60 [2022-04-08 07:44:07,699 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 07:44:07,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:44:07,700 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:07,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:44:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 07:44:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 07:44:07,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:07,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:07,781 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:07,781 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:07,784 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-08 07:44:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 07:44:07,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:07,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:07,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-08 07:44:07,785 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 55 states. [2022-04-08 07:44:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:07,786 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-08 07:44:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 07:44:07,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:07,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:07,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:07,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-08 07:44:07,790 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-08 07:44:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:07,790 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-08 07:44:07,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:07,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-08 07:44:07,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 07:44:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 07:44:07,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:07,865 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:07,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:08,065 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 07:44:08,066 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times [2022-04-08 07:44:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:08,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648934593] [2022-04-08 07:44:08,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:08,161 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:08,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times [2022-04-08 07:44:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:08,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61593875] [2022-04-08 07:44:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:08,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:08,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945603198] [2022-04-08 07:44:08,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:08,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:08,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:08,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 07:44:08,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:08,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:08,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 07:44:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:08,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:08,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-08 07:44:08,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:08,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:08,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:08,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:08,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {4522#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:08,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {4522#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {4538#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,634 INFO L272 TraceCheckUtils]: 8: Hoare triple {4538#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,635 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4538#(<= ~counter~0 1)} {4538#(<= ~counter~0 1)} #51#return; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {4538#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:08,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {4538#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,637 INFO L272 TraceCheckUtils]: 16: Hoare triple {4563#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,638 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4563#(<= ~counter~0 2)} {4563#(<= ~counter~0 2)} #51#return; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {4563#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:08,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {4563#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {4588#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,640 INFO L272 TraceCheckUtils]: 24: Hoare triple {4588#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,641 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4588#(<= ~counter~0 3)} {4588#(<= ~counter~0 3)} #51#return; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {4588#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:08,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,643 INFO L272 TraceCheckUtils]: 32: Hoare triple {4613#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,644 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#(<= ~counter~0 4)} {4613#(<= ~counter~0 4)} #51#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {4613#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {4613#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,646 INFO L272 TraceCheckUtils]: 40: Hoare triple {4638#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,647 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4638#(<= ~counter~0 5)} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {4638#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {4638#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4663#(<= |main_#t~post5| 5)} is VALID [2022-04-08 07:44:08,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {4515#false} is VALID [2022-04-08 07:44:08,648 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID [2022-04-08 07:44:08,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-08 07:44:08,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-08 07:44:08,649 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-08 07:44:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:08,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:08,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-08 07:44:08,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-08 07:44:08,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-08 07:44:08,934 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID [2022-04-08 07:44:08,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4515#false} is VALID [2022-04-08 07:44:08,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {4695#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4691#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:44:08,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {4695#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4695#(< ~counter~0 10)} is VALID [2022-04-08 07:44:08,935 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 10)} #51#return; {4695#(< ~counter~0 10)} is VALID [2022-04-08 07:44:08,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 07:44:08,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 07:44:08,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 07:44:08,935 INFO L272 TraceCheckUtils]: 40: Hoare triple {4695#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 07:44:08,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {4695#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4695#(< ~counter~0 10)} is VALID [2022-04-08 07:44:08,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {4720#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4695#(< ~counter~0 10)} is VALID [2022-04-08 07:44:08,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {4720#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4720#(< ~counter~0 9)} is VALID [2022-04-08 07:44:08,937 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 9)} #51#return; {4720#(< ~counter~0 9)} is VALID [2022-04-08 07:44:08,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 07:44:08,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 07:44:08,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 07:44:08,937 INFO L272 TraceCheckUtils]: 32: Hoare triple {4720#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 07:44:08,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {4720#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4720#(< ~counter~0 9)} is VALID [2022-04-08 07:44:08,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4720#(< ~counter~0 9)} is VALID [2022-04-08 07:44:08,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4745#(< ~counter~0 8)} is VALID [2022-04-08 07:44:08,938 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 8)} #51#return; {4745#(< ~counter~0 8)} is VALID [2022-04-08 07:44:08,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 07:44:08,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 07:44:08,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 07:44:08,939 INFO L272 TraceCheckUtils]: 24: Hoare triple {4745#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 07:44:08,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {4745#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4745#(< ~counter~0 8)} is VALID [2022-04-08 07:44:08,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4745#(< ~counter~0 8)} is VALID [2022-04-08 07:44:08,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(< ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4770#(< ~counter~0 7)} is VALID [2022-04-08 07:44:08,940 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 7)} #51#return; {4770#(< ~counter~0 7)} is VALID [2022-04-08 07:44:08,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 07:44:08,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 07:44:08,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 07:44:08,940 INFO L272 TraceCheckUtils]: 16: Hoare triple {4770#(< ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 07:44:08,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4770#(< ~counter~0 7)} is VALID [2022-04-08 07:44:08,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {4638#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(< ~counter~0 7)} is VALID [2022-04-08 07:44:08,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,942 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 07:44:08,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 07:44:08,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 07:44:08,942 INFO L272 TraceCheckUtils]: 8: Hoare triple {4638#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-08 07:44:08,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {4613#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:08,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {4613#(<= ~counter~0 4)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {4613#(<= ~counter~0 4)} call #t~ret6 := main(); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4613#(<= ~counter~0 4)} {4514#true} #57#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:08,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-08 07:44:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 07:44:08,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:08,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61593875] [2022-04-08 07:44:08,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:08,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945603198] [2022-04-08 07:44:08,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945603198] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:08,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:08,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 07:44:08,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:08,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648934593] [2022-04-08 07:44:08,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648934593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:08,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:08,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 07:44:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662664796] [2022-04-08 07:44:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-04-08 07:44:08,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:08,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:08,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:08,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 07:44:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 07:44:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:08,994 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:09,214 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-08 07:44:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:44:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-04-08 07:44:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-08 07:44:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-08 07:44:09,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-08 07:44:09,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:09,273 INFO L225 Difference]: With dead ends: 66 [2022-04-08 07:44:09,273 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 07:44:09,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:44:09,275 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:09,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 07:44:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 07:44:09,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:09,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:09,357 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:09,357 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:09,358 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 07:44:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 07:44:09,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:09,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:09,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-04-08 07:44:09,363 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-04-08 07:44:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:09,364 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 07:44:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 07:44:09,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:09,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:09,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:09,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-08 07:44:09,365 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52 [2022-04-08 07:44:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:09,366 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-08 07:44:09,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:44:09,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-08 07:44:09,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 07:44:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 07:44:09,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:09,435 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:09,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:09,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 07:44:09,643 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times [2022-04-08 07:44:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:09,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158280447] [2022-04-08 07:44:09,734 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:09,735 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:09,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times [2022-04-08 07:44:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:09,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235485692] [2022-04-08 07:44:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:09,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:09,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733147078] [2022-04-08 07:44:09,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:09,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:09,759 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:09,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 07:44:10,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:10,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:10,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:44:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:10,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:10,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {5225#true} call ULTIMATE.init(); {5225#true} is VALID [2022-04-08 07:44:10,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {5225#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5225#true} is VALID [2022-04-08 07:44:10,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5225#true} {5225#true} #57#return; {5225#true} is VALID [2022-04-08 07:44:10,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {5225#true} call #t~ret6 := main(); {5225#true} is VALID [2022-04-08 07:44:10,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {5225#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:10,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:10,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:10,470 INFO L272 TraceCheckUtils]: 8: Hoare triple {5245#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 07:44:10,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 07:44:10,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 07:44:10,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,471 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5225#true} {5245#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5245#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:10,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {5245#(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 + ~x~0; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:10,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:10,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:10,472 INFO L272 TraceCheckUtils]: 16: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 07:44:10,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 07:44:10,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 07:44:10,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,473 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5225#true} {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 07:44:10,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {5270#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:10,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:10,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:10,474 INFO L272 TraceCheckUtils]: 24: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 07:44:10,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 07:44:10,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 07:44:10,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,475 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5225#true} {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:10,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {5295#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:44:10,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:44:10,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:44:10,476 INFO L272 TraceCheckUtils]: 32: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 07:44:10,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 07:44:10,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 07:44:10,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,476 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5225#true} {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 07:44:10,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {5320#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:44:10,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:44:10,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:44:10,478 INFO L272 TraceCheckUtils]: 40: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 07:44:10,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 07:44:10,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 07:44:10,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,478 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5225#true} {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 07:44:10,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {5345#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:10,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:10,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:10,479 INFO L272 TraceCheckUtils]: 48: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5225#true} is VALID [2022-04-08 07:44:10,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {5225#true} ~cond := #in~cond; {5225#true} is VALID [2022-04-08 07:44:10,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {5225#true} assume !(0 == ~cond); {5225#true} is VALID [2022-04-08 07:44:10,480 INFO L290 TraceCheckUtils]: 51: Hoare triple {5225#true} assume true; {5225#true} is VALID [2022-04-08 07:44:10,480 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5225#true} {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:10,481 INFO L290 TraceCheckUtils]: 53: Hoare triple {5370#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {5395#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 07:44:10,481 INFO L272 TraceCheckUtils]: 54: Hoare triple {5395#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:10,481 INFO L290 TraceCheckUtils]: 55: Hoare triple {5399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:10,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {5403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5226#false} is VALID [2022-04-08 07:44:10,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {5226#false} assume !false; {5226#false} is VALID [2022-04-08 07:44:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 07:44:10,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:10,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235485692] [2022-04-08 07:44:10,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:10,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733147078] [2022-04-08 07:44:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733147078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:10,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:10,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 07:44:10,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:10,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158280447] [2022-04-08 07:44:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158280447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:10,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:44:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573133567] [2022-04-08 07:44:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-08 07:44:10,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:10,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:10,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:10,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:44:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:44:10,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:10,801 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:11,359 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 07:44:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:44:11,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-08 07:44:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 07:44:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 07:44:11,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-08 07:44:11,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:11,400 INFO L225 Difference]: With dead ends: 68 [2022-04-08 07:44:11,400 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 07:44:11,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:44:11,400 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:11,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:44:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 07:44:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 07:44:11,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:11,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:11,478 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:11,478 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:11,482 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 07:44:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 07:44:11,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:11,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:11,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-08 07:44:11,483 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-08 07:44:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:11,484 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 07:44:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 07:44:11,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:11,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:11,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:11,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-08 07:44:11,487 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2022-04-08 07:44:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:11,487 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-08 07:44:11,487 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:11,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-08 07:44:11,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 07:44:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 07:44:11,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:11,580 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:11,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:11,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 07:44:11,781 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times [2022-04-08 07:44:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:11,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457537090] [2022-04-08 07:44:11,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:11,868 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:11,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times [2022-04-08 07:44:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:11,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963837] [2022-04-08 07:44:11,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:11,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:11,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65242174] [2022-04-08 07:44:11,881 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:11,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:11,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:11,882 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:11,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 07:44:12,053 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:44:12,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 07:44:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:12,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:12,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2022-04-08 07:44:12,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {5846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:12,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {5854#(<= ~counter~0 0)} assume true; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:12,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5854#(<= ~counter~0 0)} {5846#true} #57#return; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:12,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {5854#(<= ~counter~0 0)} call #t~ret6 := main(); {5854#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:12,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {5854#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5854#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:12,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {5854#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {5870#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,380 INFO L272 TraceCheckUtils]: 8: Hoare triple {5870#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {5870#(<= ~counter~0 1)} ~cond := #in~cond; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {5870#(<= ~counter~0 1)} assume !(0 == ~cond); {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {5870#(<= ~counter~0 1)} assume true; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,381 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5870#(<= ~counter~0 1)} {5870#(<= ~counter~0 1)} #51#return; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {5870#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5870#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:12,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {5870#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {5895#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,382 INFO L272 TraceCheckUtils]: 16: Hoare triple {5895#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {5895#(<= ~counter~0 2)} ~cond := #in~cond; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {5895#(<= ~counter~0 2)} assume !(0 == ~cond); {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {5895#(<= ~counter~0 2)} assume true; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,383 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5895#(<= ~counter~0 2)} {5895#(<= ~counter~0 2)} #51#return; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {5895#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5895#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:12,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {5895#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {5920#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,385 INFO L272 TraceCheckUtils]: 24: Hoare triple {5920#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {5920#(<= ~counter~0 3)} ~cond := #in~cond; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {5920#(<= ~counter~0 3)} assume !(0 == ~cond); {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {5920#(<= ~counter~0 3)} assume true; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,386 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5920#(<= ~counter~0 3)} {5920#(<= ~counter~0 3)} #51#return; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {5920#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {5920#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {5945#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,387 INFO L272 TraceCheckUtils]: 32: Hoare triple {5945#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {5945#(<= ~counter~0 4)} ~cond := #in~cond; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {5945#(<= ~counter~0 4)} assume !(0 == ~cond); {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {5945#(<= ~counter~0 4)} assume true; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,389 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5945#(<= ~counter~0 4)} {5945#(<= ~counter~0 4)} #51#return; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {5945#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {5945#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {5970#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,390 INFO L272 TraceCheckUtils]: 40: Hoare triple {5970#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {5970#(<= ~counter~0 5)} ~cond := #in~cond; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {5970#(<= ~counter~0 5)} assume !(0 == ~cond); {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {5970#(<= ~counter~0 5)} assume true; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,391 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5970#(<= ~counter~0 5)} {5970#(<= ~counter~0 5)} #51#return; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {5970#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {5970#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {5995#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,393 INFO L272 TraceCheckUtils]: 48: Hoare triple {5995#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {5995#(<= ~counter~0 6)} ~cond := #in~cond; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {5995#(<= ~counter~0 6)} assume !(0 == ~cond); {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {5995#(<= ~counter~0 6)} assume true; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,394 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5995#(<= ~counter~0 6)} {5995#(<= ~counter~0 6)} #51#return; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {5995#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {5995#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6020#(<= |main_#t~post5| 6)} is VALID [2022-04-08 07:44:12,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {6020#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {5847#false} is VALID [2022-04-08 07:44:12,395 INFO L272 TraceCheckUtils]: 56: Hoare triple {5847#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5847#false} is VALID [2022-04-08 07:44:12,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {5847#false} ~cond := #in~cond; {5847#false} is VALID [2022-04-08 07:44:12,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {5847#false} assume 0 == ~cond; {5847#false} is VALID [2022-04-08 07:44:12,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2022-04-08 07:44:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:12,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:12,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {5847#false} assume !false; {5847#false} is VALID [2022-04-08 07:44:12,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {5847#false} assume 0 == ~cond; {5847#false} is VALID [2022-04-08 07:44:12,716 INFO L290 TraceCheckUtils]: 57: Hoare triple {5847#false} ~cond := #in~cond; {5847#false} is VALID [2022-04-08 07:44:12,716 INFO L272 TraceCheckUtils]: 56: Hoare triple {5847#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5847#false} is VALID [2022-04-08 07:44:12,716 INFO L290 TraceCheckUtils]: 55: Hoare triple {6048#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5847#false} is VALID [2022-04-08 07:44:12,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {6052#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6048#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:44:12,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {6052#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6052#(< ~counter~0 10)} is VALID [2022-04-08 07:44:12,717 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5846#true} {6052#(< ~counter~0 10)} #51#return; {6052#(< ~counter~0 10)} is VALID [2022-04-08 07:44:12,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 07:44:12,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 07:44:12,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 07:44:12,717 INFO L272 TraceCheckUtils]: 48: Hoare triple {6052#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 07:44:12,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {6052#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {6052#(< ~counter~0 10)} is VALID [2022-04-08 07:44:12,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {6077#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6052#(< ~counter~0 10)} is VALID [2022-04-08 07:44:12,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {6077#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6077#(< ~counter~0 9)} is VALID [2022-04-08 07:44:12,719 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5846#true} {6077#(< ~counter~0 9)} #51#return; {6077#(< ~counter~0 9)} is VALID [2022-04-08 07:44:12,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 07:44:12,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 07:44:12,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 07:44:12,719 INFO L272 TraceCheckUtils]: 40: Hoare triple {6077#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 07:44:12,719 INFO L290 TraceCheckUtils]: 39: Hoare triple {6077#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {6077#(< ~counter~0 9)} is VALID [2022-04-08 07:44:12,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {6102#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6077#(< ~counter~0 9)} is VALID [2022-04-08 07:44:12,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {6102#(< ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6102#(< ~counter~0 8)} is VALID [2022-04-08 07:44:12,721 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5846#true} {6102#(< ~counter~0 8)} #51#return; {6102#(< ~counter~0 8)} is VALID [2022-04-08 07:44:12,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 07:44:12,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 07:44:12,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 07:44:12,721 INFO L272 TraceCheckUtils]: 32: Hoare triple {6102#(< ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 07:44:12,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {6102#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {6102#(< ~counter~0 8)} is VALID [2022-04-08 07:44:12,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {5995#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6102#(< ~counter~0 8)} is VALID [2022-04-08 07:44:12,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {5995#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,723 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5846#true} {5995#(<= ~counter~0 6)} #51#return; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 07:44:12,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 07:44:12,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 07:44:12,723 INFO L272 TraceCheckUtils]: 24: Hoare triple {5995#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 07:44:12,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {5995#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {5970#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5995#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:12,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {5970#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,724 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5846#true} {5970#(<= ~counter~0 5)} #51#return; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 07:44:12,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 07:44:12,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 07:44:12,725 INFO L272 TraceCheckUtils]: 16: Hoare triple {5970#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 07:44:12,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {5970#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {5945#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5970#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:12,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {5945#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,726 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5846#true} {5945#(<= ~counter~0 4)} #51#return; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {5846#true} assume true; {5846#true} is VALID [2022-04-08 07:44:12,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {5846#true} assume !(0 == ~cond); {5846#true} is VALID [2022-04-08 07:44:12,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {5846#true} ~cond := #in~cond; {5846#true} is VALID [2022-04-08 07:44:12,726 INFO L272 TraceCheckUtils]: 8: Hoare triple {5945#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5846#true} is VALID [2022-04-08 07:44:12,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {5945#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {5920#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5945#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:12,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {5920#(<= ~counter~0 3)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {5920#(<= ~counter~0 3)} call #t~ret6 := main(); {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5920#(<= ~counter~0 3)} {5846#true} #57#return; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {5920#(<= ~counter~0 3)} assume true; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {5846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5920#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:12,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {5846#true} call ULTIMATE.init(); {5846#true} is VALID [2022-04-08 07:44:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 07:44:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:12,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963837] [2022-04-08 07:44:12,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:12,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65242174] [2022-04-08 07:44:12,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65242174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:12,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 07:44:12,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:12,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457537090] [2022-04-08 07:44:12,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457537090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:12,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:12,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:44:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140575279] [2022-04-08 07:44:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60 [2022-04-08 07:44:12,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:12,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:12,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:12,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:44:12,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:12,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:44:12,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:12,778 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:13,003 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-08 07:44:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:44:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60 [2022-04-08 07:44:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 07:44:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 07:44:13,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-08 07:44:13,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:13,060 INFO L225 Difference]: With dead ends: 74 [2022-04-08 07:44:13,060 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 07:44:13,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:44:13,061 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:13,062 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 07:44:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 07:44:13,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:13,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:13,149 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:13,150 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:13,151 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 07:44:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 07:44:13,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:13,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:13,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-08 07:44:13,151 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-08 07:44:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:13,153 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 07:44:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 07:44:13,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:13,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:13,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:13,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-08 07:44:13,154 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-08 07:44:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:13,156 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-08 07:44:13,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:44:13,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-08 07:44:13,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 07:44:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 07:44:13,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:13,235 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:13,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:13,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:13,439 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:13,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times [2022-04-08 07:44:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:13,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126300069] [2022-04-08 07:44:13,521 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:13,521 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:13,521 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times [2022-04-08 07:44:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:13,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989075113] [2022-04-08 07:44:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:13,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:13,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182169639] [2022-04-08 07:44:13,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:13,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:13,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:13,534 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:13,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 07:44:13,872 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 07:44:13,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:13,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 07:44:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:13,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:14,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {6655#true} call ULTIMATE.init(); {6655#true} is VALID [2022-04-08 07:44:14,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {6655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6655#true} is VALID [2022-04-08 07:44:14,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6655#true} {6655#true} #57#return; {6655#true} is VALID [2022-04-08 07:44:14,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {6655#true} call #t~ret6 := main(); {6655#true} is VALID [2022-04-08 07:44:14,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {6655#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:14,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:14,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:14,319 INFO L272 TraceCheckUtils]: 8: Hoare triple {6675#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,320 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6655#true} {6675#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6675#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:14,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {6675#(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 + ~x~0; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:14,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:14,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:14,321 INFO L272 TraceCheckUtils]: 16: Hoare triple {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,322 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6655#true} {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6700#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 07:44:14,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {6700#(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 + ~x~0; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:14,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:14,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:14,323 INFO L272 TraceCheckUtils]: 24: Hoare triple {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,323 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6655#true} {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6725#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:14,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {6725#(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 + ~x~0; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:44:14,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:44:14,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:44:14,325 INFO L272 TraceCheckUtils]: 32: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,326 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6655#true} {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #51#return; {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 07:44:14,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {6750#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:44:14,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:44:14,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:44:14,327 INFO L272 TraceCheckUtils]: 40: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,327 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6655#true} {6775#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {6775#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 07:44:14,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {6775#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:14,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:14,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:14,328 INFO L272 TraceCheckUtils]: 48: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,329 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6655#true} {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #51#return; {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 07:44:14,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {6800#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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 + ~x~0; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:14,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:14,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:14,330 INFO L272 TraceCheckUtils]: 56: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6655#true} is VALID [2022-04-08 07:44:14,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {6655#true} ~cond := #in~cond; {6655#true} is VALID [2022-04-08 07:44:14,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {6655#true} assume !(0 == ~cond); {6655#true} is VALID [2022-04-08 07:44:14,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {6655#true} assume true; {6655#true} is VALID [2022-04-08 07:44:14,331 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6655#true} {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 07:44:14,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {6825#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {6850#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 07:44:14,332 INFO L272 TraceCheckUtils]: 62: Hoare triple {6850#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6854#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:14,332 INFO L290 TraceCheckUtils]: 63: Hoare triple {6854#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6858#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:14,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {6858#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6656#false} is VALID [2022-04-08 07:44:14,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {6656#false} assume !false; {6656#false} is VALID [2022-04-08 07:44:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 07:44:14,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:14,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989075113] [2022-04-08 07:44:14,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:14,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182169639] [2022-04-08 07:44:14,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182169639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:14,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:14,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 07:44:14,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:14,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126300069] [2022-04-08 07:44:14,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126300069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:14,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:14,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:44:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002997493] [2022-04-08 07:44:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-08 07:44:14,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:14,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:14,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:14,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:44:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:44:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:44:14,655 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:15,246 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 07:44:15,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:44:15,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-08 07:44:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 07:44:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 07:44:15,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-08 07:44:15,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:15,306 INFO L225 Difference]: With dead ends: 76 [2022-04-08 07:44:15,306 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 07:44:15,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:44:15,307 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:15,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 07:44:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 07:44:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 07:44:15,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:15,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:15,395 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:15,395 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:15,397 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-08 07:44:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 07:44:15,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:15,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:15,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-08 07:44:15,397 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-08 07:44:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:15,399 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-08 07:44:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 07:44:15,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:15,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:15,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:15,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-08 07:44:15,401 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2022-04-08 07:44:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:15,401 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-08 07:44:15,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:15,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-08 07:44:15,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 07:44:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 07:44:15,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:15,486 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:15,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:15,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 07:44:15,691 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:15,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times [2022-04-08 07:44:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:15,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [134570260] [2022-04-08 07:44:15,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:15,793 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:15,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times [2022-04-08 07:44:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780402794] [2022-04-08 07:44:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:15,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:15,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292835415] [2022-04-08 07:44:15,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:15,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:15,815 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:15,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 07:44:15,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:15,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:15,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 07:44:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:15,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:16,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7349#true} is VALID [2022-04-08 07:44:16,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {7349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:16,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {7357#(<= ~counter~0 0)} assume true; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:16,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7357#(<= ~counter~0 0)} {7349#true} #57#return; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:16,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {7357#(<= ~counter~0 0)} call #t~ret6 := main(); {7357#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:16,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {7357#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7357#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:16,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {7357#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {7373#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,244 INFO L272 TraceCheckUtils]: 8: Hoare triple {7373#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {7373#(<= ~counter~0 1)} ~cond := #in~cond; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {7373#(<= ~counter~0 1)} assume !(0 == ~cond); {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {7373#(<= ~counter~0 1)} assume true; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,246 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7373#(<= ~counter~0 1)} {7373#(<= ~counter~0 1)} #51#return; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {7373#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7373#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:16,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {7373#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {7398#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,247 INFO L272 TraceCheckUtils]: 16: Hoare triple {7398#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#(<= ~counter~0 2)} ~cond := #in~cond; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {7398#(<= ~counter~0 2)} assume !(0 == ~cond); {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {7398#(<= ~counter~0 2)} assume true; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,248 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7398#(<= ~counter~0 2)} {7398#(<= ~counter~0 2)} #51#return; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {7398#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {7398#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {7423#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,250 INFO L272 TraceCheckUtils]: 24: Hoare triple {7423#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {7423#(<= ~counter~0 3)} ~cond := #in~cond; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {7423#(<= ~counter~0 3)} assume !(0 == ~cond); {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {7423#(<= ~counter~0 3)} assume true; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,251 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7423#(<= ~counter~0 3)} {7423#(<= ~counter~0 3)} #51#return; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {7423#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {7423#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {7448#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,252 INFO L272 TraceCheckUtils]: 32: Hoare triple {7448#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {7448#(<= ~counter~0 4)} ~cond := #in~cond; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {7448#(<= ~counter~0 4)} assume !(0 == ~cond); {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {7448#(<= ~counter~0 4)} assume true; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,254 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7448#(<= ~counter~0 4)} {7448#(<= ~counter~0 4)} #51#return; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {7448#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {7448#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {7473#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,255 INFO L272 TraceCheckUtils]: 40: Hoare triple {7473#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {7473#(<= ~counter~0 5)} ~cond := #in~cond; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,256 INFO L290 TraceCheckUtils]: 42: Hoare triple {7473#(<= ~counter~0 5)} assume !(0 == ~cond); {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {7473#(<= ~counter~0 5)} assume true; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,256 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7473#(<= ~counter~0 5)} {7473#(<= ~counter~0 5)} #51#return; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {7473#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {7473#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {7498#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,258 INFO L272 TraceCheckUtils]: 48: Hoare triple {7498#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {7498#(<= ~counter~0 6)} ~cond := #in~cond; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {7498#(<= ~counter~0 6)} assume !(0 == ~cond); {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {7498#(<= ~counter~0 6)} assume true; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,259 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7498#(<= ~counter~0 6)} {7498#(<= ~counter~0 6)} #51#return; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {7498#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,260 INFO L290 TraceCheckUtils]: 54: Hoare triple {7498#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,260 INFO L290 TraceCheckUtils]: 55: Hoare triple {7523#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,264 INFO L272 TraceCheckUtils]: 56: Hoare triple {7523#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {7523#(<= ~counter~0 7)} ~cond := #in~cond; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {7523#(<= ~counter~0 7)} assume !(0 == ~cond); {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {7523#(<= ~counter~0 7)} assume true; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,281 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7523#(<= ~counter~0 7)} {7523#(<= ~counter~0 7)} #51#return; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {7523#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {7523#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7548#(<= |main_#t~post5| 7)} is VALID [2022-04-08 07:44:16,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {7548#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {7350#false} is VALID [2022-04-08 07:44:16,283 INFO L272 TraceCheckUtils]: 64: Hoare triple {7350#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7350#false} is VALID [2022-04-08 07:44:16,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {7350#false} ~cond := #in~cond; {7350#false} is VALID [2022-04-08 07:44:16,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {7350#false} assume 0 == ~cond; {7350#false} is VALID [2022-04-08 07:44:16,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-08 07:44:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:16,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:16,626 INFO L290 TraceCheckUtils]: 67: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-08 07:44:16,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {7350#false} assume 0 == ~cond; {7350#false} is VALID [2022-04-08 07:44:16,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {7350#false} ~cond := #in~cond; {7350#false} is VALID [2022-04-08 07:44:16,626 INFO L272 TraceCheckUtils]: 64: Hoare triple {7350#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7350#false} is VALID [2022-04-08 07:44:16,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {7576#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7350#false} is VALID [2022-04-08 07:44:16,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {7580#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7576#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:44:16,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {7580#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7580#(< ~counter~0 10)} is VALID [2022-04-08 07:44:16,628 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7349#true} {7580#(< ~counter~0 10)} #51#return; {7580#(< ~counter~0 10)} is VALID [2022-04-08 07:44:16,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,628 INFO L272 TraceCheckUtils]: 56: Hoare triple {7580#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,628 INFO L290 TraceCheckUtils]: 55: Hoare triple {7580#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7580#(< ~counter~0 10)} is VALID [2022-04-08 07:44:16,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {7605#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7580#(< ~counter~0 10)} is VALID [2022-04-08 07:44:16,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {7605#(< ~counter~0 9)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7605#(< ~counter~0 9)} is VALID [2022-04-08 07:44:16,629 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7349#true} {7605#(< ~counter~0 9)} #51#return; {7605#(< ~counter~0 9)} is VALID [2022-04-08 07:44:16,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,630 INFO L272 TraceCheckUtils]: 48: Hoare triple {7605#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,630 INFO L290 TraceCheckUtils]: 47: Hoare triple {7605#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7605#(< ~counter~0 9)} is VALID [2022-04-08 07:44:16,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {7523#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7605#(< ~counter~0 9)} is VALID [2022-04-08 07:44:16,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {7523#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,631 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7349#true} {7523#(<= ~counter~0 7)} #51#return; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,631 INFO L272 TraceCheckUtils]: 40: Hoare triple {7523#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {7523#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {7498#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7523#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:16,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {7498#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,633 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7349#true} {7498#(<= ~counter~0 6)} #51#return; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,633 INFO L272 TraceCheckUtils]: 32: Hoare triple {7498#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {7498#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {7473#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7498#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:16,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {7473#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,634 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7349#true} {7473#(<= ~counter~0 5)} #51#return; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,635 INFO L272 TraceCheckUtils]: 24: Hoare triple {7473#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {7473#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {7448#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7473#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:16,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,636 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7349#true} {7448#(<= ~counter~0 4)} #51#return; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,636 INFO L272 TraceCheckUtils]: 16: Hoare triple {7448#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {7448#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {7423#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7448#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:16,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {7423#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,638 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7349#true} {7423#(<= ~counter~0 3)} #51#return; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-08 07:44:16,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {7349#true} assume !(0 == ~cond); {7349#true} is VALID [2022-04-08 07:44:16,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {7349#true} ~cond := #in~cond; {7349#true} is VALID [2022-04-08 07:44:16,638 INFO L272 TraceCheckUtils]: 8: Hoare triple {7423#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7349#true} is VALID [2022-04-08 07:44:16,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {7423#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7423#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:16,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#(<= ~counter~0 2)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#(<= ~counter~0 2)} call #t~ret6 := main(); {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#(<= ~counter~0 2)} {7349#true} #57#return; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#(<= ~counter~0 2)} assume true; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {7349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7398#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:16,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7349#true} is VALID [2022-04-08 07:44:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 07:44:16,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:16,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780402794] [2022-04-08 07:44:16,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:16,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292835415] [2022-04-08 07:44:16,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292835415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:16,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:16,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 07:44:16,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:16,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [134570260] [2022-04-08 07:44:16,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [134570260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:16,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:16,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:44:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661413432] [2022-04-08 07:44:16,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:16,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68 [2022-04-08 07:44:16,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:16,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:16,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:16,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:44:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:16,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:44:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:16,693 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:16,952 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-08 07:44:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 07:44:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68 [2022-04-08 07:44:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 07:44:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 07:44:16,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-08 07:44:17,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:17,029 INFO L225 Difference]: With dead ends: 82 [2022-04-08 07:44:17,029 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 07:44:17,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:44:17,030 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:17,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 07:44:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-08 07:44:17,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:17,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:17,121 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:17,121 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:17,122 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 07:44:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 07:44:17,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:17,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:17,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-08 07:44:17,123 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-08 07:44:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:17,124 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 07:44:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 07:44:17,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:17,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:17,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:17,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-08 07:44:17,126 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2022-04-08 07:44:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:17,127 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-08 07:44:17,127 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:17,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-08 07:44:17,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 07:44:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 07:44:17,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:17,216 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:17,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:17,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 07:44:17,417 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times [2022-04-08 07:44:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:17,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197162822] [2022-04-08 07:44:17,501 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:17,501 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:17,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times [2022-04-08 07:44:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:17,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526119157] [2022-04-08 07:44:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:17,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:17,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754842471] [2022-04-08 07:44:17,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:44:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:17,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:17,514 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:17,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 07:44:17,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:44:17,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:17,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 07:44:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:17,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:18,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {8256#true} call ULTIMATE.init(); {8256#true} is VALID [2022-04-08 07:44:18,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {8256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8256#true} is VALID [2022-04-08 07:44:18,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8256#true} {8256#true} #57#return; {8256#true} is VALID [2022-04-08 07:44:18,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {8256#true} call #t~ret6 := main(); {8256#true} is VALID [2022-04-08 07:44:18,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {8256#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:18,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:18,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:18,418 INFO L272 TraceCheckUtils]: 8: Hoare triple {8276#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,419 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8256#true} {8276#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {8276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:18,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {8276#(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 + ~x~0; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:18,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:18,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:18,420 INFO L272 TraceCheckUtils]: 16: Hoare triple {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,421 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8256#true} {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {8301#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 07:44:18,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {8301#(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 + ~x~0; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:18,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:18,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:18,423 INFO L272 TraceCheckUtils]: 24: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,424 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8256#true} {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:18,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {8326#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:18,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:18,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:18,426 INFO L272 TraceCheckUtils]: 32: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,427 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8256#true} {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 07:44:18,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {8351#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:18,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:18,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:18,429 INFO L272 TraceCheckUtils]: 40: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,429 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8256#true} {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 07:44:18,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {8376#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:18,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:18,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:18,431 INFO L272 TraceCheckUtils]: 48: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,432 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8256#true} {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:18,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {8401#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:18,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:18,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 10);havoc #t~post5; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:18,434 INFO L272 TraceCheckUtils]: 56: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,435 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8256#true} {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:18,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {8426#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:18,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:18,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:18,436 INFO L272 TraceCheckUtils]: 64: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8256#true} is VALID [2022-04-08 07:44:18,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {8256#true} ~cond := #in~cond; {8256#true} is VALID [2022-04-08 07:44:18,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {8256#true} assume !(0 == ~cond); {8256#true} is VALID [2022-04-08 07:44:18,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {8256#true} assume true; {8256#true} is VALID [2022-04-08 07:44:18,437 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8256#true} {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:18,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {8451#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {8476#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 07:44:18,439 INFO L272 TraceCheckUtils]: 70: Hoare triple {8476#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:18,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {8480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:18,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {8484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8257#false} is VALID [2022-04-08 07:44:18,440 INFO L290 TraceCheckUtils]: 73: Hoare triple {8257#false} assume !false; {8257#false} is VALID [2022-04-08 07:44:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 07:44:18,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526119157] [2022-04-08 07:44:18,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754842471] [2022-04-08 07:44:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754842471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:18,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:18,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 07:44:18,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197162822] [2022-04-08 07:44:18,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197162822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:18,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:18,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:44:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803311223] [2022-04-08 07:44:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-08 07:44:18,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:18,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:18,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:18,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:44:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:18,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:44:18,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:44:18,780 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:19,512 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 07:44:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:44:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-08 07:44:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 07:44:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 07:44:19,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-08 07:44:19,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:19,562 INFO L225 Difference]: With dead ends: 84 [2022-04-08 07:44:19,562 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 07:44:19,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:44:19,563 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:19,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:44:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 07:44:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 07:44:19,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:19,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:19,656 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:19,657 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:19,658 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-08 07:44:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 07:44:19,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:19,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:19,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states. [2022-04-08 07:44:19,658 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 79 states. [2022-04-08 07:44:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:19,659 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-08 07:44:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 07:44:19,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:19,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:19,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:19,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-08 07:44:19,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2022-04-08 07:44:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:19,662 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-08 07:44:19,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:19,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-08 07:44:19,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 07:44:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 07:44:19,795 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:19,795 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:19,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-08 07:44:19,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 07:44:19,996 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times [2022-04-08 07:44:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:19,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745850370] [2022-04-08 07:44:20,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:20,071 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:20,071 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times [2022-04-08 07:44:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:20,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079432221] [2022-04-08 07:44:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:20,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116731420] [2022-04-08 07:44:20,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:20,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:20,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:20,089 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:20,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 07:44:20,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:20,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:20,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 07:44:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:20,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:21,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {9023#true} call ULTIMATE.init(); {9023#true} is VALID [2022-04-08 07:44:21,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {9023#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:21,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {9031#(<= ~counter~0 0)} assume true; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:21,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9031#(<= ~counter~0 0)} {9023#true} #57#return; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:21,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {9031#(<= ~counter~0 0)} call #t~ret6 := main(); {9031#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:21,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {9031#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9031#(<= ~counter~0 0)} is VALID [2022-04-08 07:44:21,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {9031#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {9047#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,328 INFO L272 TraceCheckUtils]: 8: Hoare triple {9047#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {9047#(<= ~counter~0 1)} ~cond := #in~cond; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {9047#(<= ~counter~0 1)} assume !(0 == ~cond); {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {9047#(<= ~counter~0 1)} assume true; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,329 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9047#(<= ~counter~0 1)} {9047#(<= ~counter~0 1)} #51#return; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {9047#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {9047#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {9072#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,330 INFO L272 TraceCheckUtils]: 16: Hoare triple {9072#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {9072#(<= ~counter~0 2)} ~cond := #in~cond; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {9072#(<= ~counter~0 2)} assume !(0 == ~cond); {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {9072#(<= ~counter~0 2)} assume true; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,332 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9072#(<= ~counter~0 2)} {9072#(<= ~counter~0 2)} #51#return; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {9072#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {9072#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {9097#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,333 INFO L272 TraceCheckUtils]: 24: Hoare triple {9097#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {9097#(<= ~counter~0 3)} ~cond := #in~cond; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {9097#(<= ~counter~0 3)} assume !(0 == ~cond); {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {9097#(<= ~counter~0 3)} assume true; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,334 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9097#(<= ~counter~0 3)} {9097#(<= ~counter~0 3)} #51#return; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {9097#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {9097#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {9122#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,336 INFO L272 TraceCheckUtils]: 32: Hoare triple {9122#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {9122#(<= ~counter~0 4)} ~cond := #in~cond; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {9122#(<= ~counter~0 4)} assume !(0 == ~cond); {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {9122#(<= ~counter~0 4)} assume true; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,337 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9122#(<= ~counter~0 4)} {9122#(<= ~counter~0 4)} #51#return; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {9122#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {9122#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {9147#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,338 INFO L272 TraceCheckUtils]: 40: Hoare triple {9147#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {9147#(<= ~counter~0 5)} ~cond := #in~cond; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {9147#(<= ~counter~0 5)} assume !(0 == ~cond); {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {9147#(<= ~counter~0 5)} assume true; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,339 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9147#(<= ~counter~0 5)} {9147#(<= ~counter~0 5)} #51#return; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {9147#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {9147#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {9172#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,341 INFO L272 TraceCheckUtils]: 48: Hoare triple {9172#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {9172#(<= ~counter~0 6)} ~cond := #in~cond; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {9172#(<= ~counter~0 6)} assume !(0 == ~cond); {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,342 INFO L290 TraceCheckUtils]: 51: Hoare triple {9172#(<= ~counter~0 6)} assume true; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,342 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9172#(<= ~counter~0 6)} {9172#(<= ~counter~0 6)} #51#return; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {9172#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {9172#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {9197#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,355 INFO L272 TraceCheckUtils]: 56: Hoare triple {9197#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {9197#(<= ~counter~0 7)} ~cond := #in~cond; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {9197#(<= ~counter~0 7)} assume !(0 == ~cond); {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {9197#(<= ~counter~0 7)} assume true; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,357 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9197#(<= ~counter~0 7)} {9197#(<= ~counter~0 7)} #51#return; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {9197#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {9197#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,358 INFO L290 TraceCheckUtils]: 63: Hoare triple {9222#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,359 INFO L272 TraceCheckUtils]: 64: Hoare triple {9222#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {9222#(<= ~counter~0 8)} ~cond := #in~cond; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {9222#(<= ~counter~0 8)} assume !(0 == ~cond); {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,360 INFO L290 TraceCheckUtils]: 67: Hoare triple {9222#(<= ~counter~0 8)} assume true; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,360 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9222#(<= ~counter~0 8)} {9222#(<= ~counter~0 8)} #51#return; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {9222#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {9222#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9247#(<= |main_#t~post5| 8)} is VALID [2022-04-08 07:44:21,361 INFO L290 TraceCheckUtils]: 71: Hoare triple {9247#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {9024#false} is VALID [2022-04-08 07:44:21,361 INFO L272 TraceCheckUtils]: 72: Hoare triple {9024#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9024#false} is VALID [2022-04-08 07:44:21,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {9024#false} ~cond := #in~cond; {9024#false} is VALID [2022-04-08 07:44:21,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {9024#false} assume 0 == ~cond; {9024#false} is VALID [2022-04-08 07:44:21,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {9024#false} assume !false; {9024#false} is VALID [2022-04-08 07:44:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 07:44:21,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:21,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {9024#false} assume !false; {9024#false} is VALID [2022-04-08 07:44:21,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {9024#false} assume 0 == ~cond; {9024#false} is VALID [2022-04-08 07:44:21,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {9024#false} ~cond := #in~cond; {9024#false} is VALID [2022-04-08 07:44:21,740 INFO L272 TraceCheckUtils]: 72: Hoare triple {9024#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9024#false} is VALID [2022-04-08 07:44:21,740 INFO L290 TraceCheckUtils]: 71: Hoare triple {9275#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {9024#false} is VALID [2022-04-08 07:44:21,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {9279#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9275#(< |main_#t~post5| 10)} is VALID [2022-04-08 07:44:21,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {9279#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9279#(< ~counter~0 10)} is VALID [2022-04-08 07:44:21,741 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9023#true} {9279#(< ~counter~0 10)} #51#return; {9279#(< ~counter~0 10)} is VALID [2022-04-08 07:44:21,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,742 INFO L290 TraceCheckUtils]: 65: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,742 INFO L272 TraceCheckUtils]: 64: Hoare triple {9279#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {9279#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9279#(< ~counter~0 10)} is VALID [2022-04-08 07:44:21,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {9222#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9279#(< ~counter~0 10)} is VALID [2022-04-08 07:44:21,743 INFO L290 TraceCheckUtils]: 61: Hoare triple {9222#(<= ~counter~0 8)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,743 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9023#true} {9222#(<= ~counter~0 8)} #51#return; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,743 INFO L272 TraceCheckUtils]: 56: Hoare triple {9222#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {9222#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {9197#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9222#(<= ~counter~0 8)} is VALID [2022-04-08 07:44:21,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {9197#(<= ~counter~0 7)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,752 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9023#true} {9197#(<= ~counter~0 7)} #51#return; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,752 INFO L290 TraceCheckUtils]: 50: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,753 INFO L272 TraceCheckUtils]: 48: Hoare triple {9197#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {9197#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {9172#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9197#(<= ~counter~0 7)} is VALID [2022-04-08 07:44:21,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {9172#(<= ~counter~0 6)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,754 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9023#true} {9172#(<= ~counter~0 6)} #51#return; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,755 INFO L272 TraceCheckUtils]: 40: Hoare triple {9172#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {9172#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {9147#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9172#(<= ~counter~0 6)} is VALID [2022-04-08 07:44:21,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {9147#(<= ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,757 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9023#true} {9147#(<= ~counter~0 5)} #51#return; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,757 INFO L272 TraceCheckUtils]: 32: Hoare triple {9147#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {9147#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {9122#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9147#(<= ~counter~0 5)} is VALID [2022-04-08 07:44:21,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {9122#(<= ~counter~0 4)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,759 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9023#true} {9122#(<= ~counter~0 4)} #51#return; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,759 INFO L272 TraceCheckUtils]: 24: Hoare triple {9122#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {9122#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {9097#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9122#(<= ~counter~0 4)} is VALID [2022-04-08 07:44:21,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {9097#(<= ~counter~0 3)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,761 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9023#true} {9097#(<= ~counter~0 3)} #51#return; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,762 INFO L272 TraceCheckUtils]: 16: Hoare triple {9097#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {9097#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {9072#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9097#(<= ~counter~0 3)} is VALID [2022-04-08 07:44:21,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {9072#(<= ~counter~0 2)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,763 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9023#true} {9072#(<= ~counter~0 2)} #51#return; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {9023#true} assume true; {9023#true} is VALID [2022-04-08 07:44:21,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {9023#true} assume !(0 == ~cond); {9023#true} is VALID [2022-04-08 07:44:21,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {9023#true} ~cond := #in~cond; {9023#true} is VALID [2022-04-08 07:44:21,764 INFO L272 TraceCheckUtils]: 8: Hoare triple {9072#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9023#true} is VALID [2022-04-08 07:44:21,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {9072#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {9047#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9072#(<= ~counter~0 2)} is VALID [2022-04-08 07:44:21,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {9047#(<= ~counter~0 1)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {9047#(<= ~counter~0 1)} call #t~ret6 := main(); {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9047#(<= ~counter~0 1)} {9023#true} #57#return; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {9047#(<= ~counter~0 1)} assume true; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {9023#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9047#(<= ~counter~0 1)} is VALID [2022-04-08 07:44:21,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {9023#true} call ULTIMATE.init(); {9023#true} is VALID [2022-04-08 07:44:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 07:44:21,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079432221] [2022-04-08 07:44:21,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116731420] [2022-04-08 07:44:21,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116731420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:21,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 07:44:21,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:21,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745850370] [2022-04-08 07:44:21,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745850370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:21,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:21,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:44:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327613481] [2022-04-08 07:44:21,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76 [2022-04-08 07:44:21,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:21,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:21,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:21,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:44:21,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:44:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:44:21,821 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:22,141 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 07:44:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 07:44:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76 [2022-04-08 07:44:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:22,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-08 07:44:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-08 07:44:22,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-08 07:44:22,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:22,225 INFO L225 Difference]: With dead ends: 90 [2022-04-08 07:44:22,225 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 07:44:22,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-08 07:44:22,226 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:22,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:44:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 07:44:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 07:44:22,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:22,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:22,349 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:22,349 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:22,351 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 07:44:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 07:44:22,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:22,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:22,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-08 07:44:22,352 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-08 07:44:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:22,353 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 07:44:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 07:44:22,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:22,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:22,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:22,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-08 07:44:22,355 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2022-04-08 07:44:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:22,355 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-08 07:44:22,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:44:22,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-08 07:44:22,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 07:44:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 07:44:22,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:22,457 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:22,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:22,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:22,662 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times [2022-04-08 07:44:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:22,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259739337] [2022-04-08 07:44:22,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:22,739 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:22,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times [2022-04-08 07:44:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:22,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495535165] [2022-04-08 07:44:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:22,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109900401] [2022-04-08 07:44:22,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:44:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:22,758 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:22,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 07:44:23,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:44:23,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:23,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 07:44:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:23,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:23,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {10028#true} call ULTIMATE.init(); {10028#true} is VALID [2022-04-08 07:44:23,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {10028#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10028#true} is VALID [2022-04-08 07:44:23,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10028#true} {10028#true} #57#return; {10028#true} is VALID [2022-04-08 07:44:23,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {10028#true} call #t~ret6 := main(); {10028#true} is VALID [2022-04-08 07:44:23,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {10028#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:23,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:23,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:23,818 INFO L272 TraceCheckUtils]: 8: Hoare triple {10048#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,818 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10028#true} {10048#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10048#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 07:44:23,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {10048#(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 + ~x~0; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:23,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:23,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:23,820 INFO L272 TraceCheckUtils]: 16: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,820 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10028#true} {10073#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {10073#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 07:44:23,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {10073#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:23,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:23,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:23,821 INFO L272 TraceCheckUtils]: 24: Hoare triple {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,822 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10028#true} {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {10098#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 07:44:23,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {10098#(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 + ~x~0; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:23,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:23,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:23,823 INFO L272 TraceCheckUtils]: 32: Hoare triple {10123#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,824 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10028#true} {10123#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {10123#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 07:44:23,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {10123#(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 + ~x~0; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:23,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:23,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:23,825 INFO L272 TraceCheckUtils]: 40: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,825 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10028#true} {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #51#return; {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 07:44:23,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {10148#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:23,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:23,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:23,827 INFO L272 TraceCheckUtils]: 48: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,827 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10028#true} {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 07:44:23,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {10173#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:23,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:23,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 10);havoc #t~post5; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:23,828 INFO L272 TraceCheckUtils]: 56: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,829 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10028#true} {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 07:44:23,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {10198#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:23,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:23,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:23,830 INFO L272 TraceCheckUtils]: 64: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,830 INFO L290 TraceCheckUtils]: 65: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,830 INFO L290 TraceCheckUtils]: 66: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,830 INFO L290 TraceCheckUtils]: 67: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,831 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10028#true} {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 07:44:23,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {10223#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:23,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:23,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:23,832 INFO L272 TraceCheckUtils]: 72: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10028#true} is VALID [2022-04-08 07:44:23,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {10028#true} ~cond := #in~cond; {10028#true} is VALID [2022-04-08 07:44:23,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {10028#true} assume !(0 == ~cond); {10028#true} is VALID [2022-04-08 07:44:23,832 INFO L290 TraceCheckUtils]: 75: Hoare triple {10028#true} assume true; {10028#true} is VALID [2022-04-08 07:44:23,832 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10028#true} {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #51#return; {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 07:44:23,833 INFO L290 TraceCheckUtils]: 77: Hoare triple {10248#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {10273#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 07:44:23,834 INFO L272 TraceCheckUtils]: 78: Hoare triple {10273#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:23,834 INFO L290 TraceCheckUtils]: 79: Hoare triple {10277#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10281#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:23,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {10281#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10029#false} is VALID [2022-04-08 07:44:23,835 INFO L290 TraceCheckUtils]: 81: Hoare triple {10029#false} assume !false; {10029#false} is VALID [2022-04-08 07:44:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 07:44:23,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495535165] [2022-04-08 07:44:24,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109900401] [2022-04-08 07:44:24,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109900401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 07:44:24,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:44:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 07:44:24,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:24,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259739337] [2022-04-08 07:44:24,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259739337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:24,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:24,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:44:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135558716] [2022-04-08 07:44:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-08 07:44:24,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:24,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:24,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:24,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:44:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:44:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:44:24,170 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:25,091 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 07:44:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:44:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-08 07:44:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 07:44:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 07:44:25,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-08 07:44:25,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:25,157 INFO L225 Difference]: With dead ends: 92 [2022-04-08 07:44:25,157 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 07:44:25,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:44:25,158 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:25,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:44:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 07:44:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-08 07:44:25,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:25,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:25,270 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:25,270 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:25,272 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-08 07:44:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 07:44:25,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:25,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:25,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 87 states. [2022-04-08 07:44:25,272 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 87 states. [2022-04-08 07:44:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:25,274 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-08 07:44:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 07:44:25,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:25,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:25,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:25,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 07:44:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-08 07:44:25,276 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2022-04-08 07:44:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:25,276 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-08 07:44:25,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:44:25,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-08 07:44:25,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 07:44:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 07:44:25,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:25,405 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:44:25,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 07:44:25,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:25,606 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times [2022-04-08 07:44:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:25,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929682857] [2022-04-08 07:44:25,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:25,703 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:25,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times [2022-04-08 07:44:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:25,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504780949] [2022-04-08 07:44:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:25,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:25,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685397477] [2022-04-08 07:44:25,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:25,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:25,723 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 07:44:25,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process