/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:27:05,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:27:05,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:27:05,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:27:05,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:27:05,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:27:05,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:27:05,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:27:05,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:27:05,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:27:05,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:27:05,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:27:05,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:27:05,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:27:05,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:27:05,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:27:05,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:27:05,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:27:05,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:27:05,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:27:05,354 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:27:05,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:27:05,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:27:05,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:27:05,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:27:05,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:27:05,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:27:05,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:27:05,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:27:05,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:27:05,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:27:05,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:27:05,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:27:05,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:27:05,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:27:05,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:27:05,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:27:05,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:27:05,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:27:05,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:27:05,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:27:05,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:27:05,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:27:05,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:27:05,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:27:05,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:27:05,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:27:05,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:27:05,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:27:05,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:27:05,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:27:05,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:27:05,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:27:05,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:27:05,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:27:05,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:27:05,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:27:05,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:27:05,381 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:27:05,381 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 14:27:05,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:27:05,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:27:05,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:27:05,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:27:05,533 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:27:05,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2022-04-08 14:27:05,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c249a3860/5a05bc662fc74d77b6c0d8093de05bf3/FLAG768b37b5e [2022-04-08 14:27:05,904 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:27:05,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2022-04-08 14:27:05,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c249a3860/5a05bc662fc74d77b6c0d8093de05bf3/FLAG768b37b5e [2022-04-08 14:27:06,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c249a3860/5a05bc662fc74d77b6c0d8093de05bf3 [2022-04-08 14:27:06,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:27:06,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:27:06,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:27:06,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:27:06,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:27:06,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1f88b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06, skipping insertion in model container [2022-04-08 14:27:06,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:27:06,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:27:06,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c[458,471] [2022-04-08 14:27:06,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:27:06,520 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:27:06,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c[458,471] [2022-04-08 14:27:06,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:27:06,554 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:27:06,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06 WrapperNode [2022-04-08 14:27:06,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:27:06,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:27:06,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:27:06,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:27:06,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:27:06,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:27:06,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:27:06,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:27:06,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (1/1) ... [2022-04-08 14:27:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:27:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:06,613 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 14:27:06,618 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 14:27:06,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:27:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:27:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:27:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:27:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:27:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:27:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:27:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:27:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:27:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:27:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:27:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:27:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:27:06,682 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:27:06,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:27:06,826 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:27:06,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:27:06,849 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:27:06,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:27:06 BoogieIcfgContainer [2022-04-08 14:27:06,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:27:06,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:27:06,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:27:06,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:27:06,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:27:06" (1/3) ... [2022-04-08 14:27:06,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753abf55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:27:06, skipping insertion in model container [2022-04-08 14:27:06,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:27:06" (2/3) ... [2022-04-08 14:27:06,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753abf55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:27:06, skipping insertion in model container [2022-04-08 14:27:06,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:27:06" (3/3) ... [2022-04-08 14:27:06,868 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound20.c [2022-04-08 14:27:06,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:27:06,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:27:06,896 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:27:06,900 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 14:27:06,901 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:27:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:27:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:27:06,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:06,917 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:06,917 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-08 14:27:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:06,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37534127] [2022-04-08 14:27:06,939 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-08 14:27:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:06,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761963554] [2022-04-08 14:27:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:27:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:07,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 14:27:07,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:27:07,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:27:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:27:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:07,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:27:07,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:27:07,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:27:07,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:27:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 14:27:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:07,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:27:07,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:27:07,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:27:07,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:27:07,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:27:07,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 14:27:07,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:27:07,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:27:07,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 14:27:07,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-08 14:27:07,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {32#true} is VALID [2022-04-08 14:27:07,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:27:07,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:27:07,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:27:07,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:27:07,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 14:27:07,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:27:07,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:27:07,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:27:07,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:27:07,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:27:07,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-08 14:27:07,160 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 14:27:07,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:27:07,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:27:07,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:27:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:27:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:07,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761963554] [2022-04-08 14:27:07,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761963554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:07,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:07,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:27:07,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:07,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37534127] [2022-04-08 14:27:07,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37534127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:07,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:07,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:27:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784815794] [2022-04-08 14:27:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:07,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:27:07,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:07,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:27:07,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:07,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:27:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:27:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:27:07,225 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:27:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:07,350 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 14:27:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:27:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:27:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:27:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:27:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:27:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:27:07,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 14:27:07,443 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 14:27:07,454 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:27:07,455 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 14:27:07,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:27:07,460 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:07,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:27:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 14:27:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 14:27:07,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:07,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:27:07,479 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:27:07,480 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:27:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:07,482 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:27:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:27:07,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:07,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:07,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:27:07,483 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:27:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:07,487 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:27:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:27:07,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:07,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:07,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:07,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:27:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:27:07,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 14:27:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:07,495 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:27:07,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:27:07,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:27:07,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:27:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:27:07,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:07,544 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:07,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:27:07,544 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-08 14:27:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:07,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196840094] [2022-04-08 14:27:07,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-08 14:27:07,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:07,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432565264] [2022-04-08 14:27:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:07,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:07,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30624125] [2022-04-08 14:27:07,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:27:07,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:07,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:07,598 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 14:27:07,598 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 14:27:07,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:27:07,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:07,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:27:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:07,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:07,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 14:27:07,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-08 14:27:07,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:27:07,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-08 14:27:07,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-08 14:27:07,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-08 14:27:07,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {246#true} is VALID [2022-04-08 14:27:07,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:27:07,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:27:07,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:27:07,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-08 14:27:07,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-08 14:27:07,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:27:07,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:27:07,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:27:07,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-08 14:27:07,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:07,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:07,809 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:07,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:07,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 14:27:07,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 14:27:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:27:07,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:27:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432565264] [2022-04-08 14:27:07,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30624125] [2022-04-08 14:27:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30624125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:07,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:07,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:27:07,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:07,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196840094] [2022-04-08 14:27:07,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196840094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:07,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:07,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:27:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171730987] [2022-04-08 14:27:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:27:07,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:07,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:27:07,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:07,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:27:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:27:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:27:07,831 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:27:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:07,939 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 14:27:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:27:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:27:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:27:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:27:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:27:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:27:07,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 14:27:07,979 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 14:27:07,981 INFO L225 Difference]: With dead ends: 35 [2022-04-08 14:27:07,981 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:27:07,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:27:07,988 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:07,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:27:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:27:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:27:08,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:08,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:08,003 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:08,004 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:08,006 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:27:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:27:08,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:08,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:08,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 14:27:08,012 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 14:27:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:08,015 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:27:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:27:08,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:08,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:08,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:08,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 14:27:08,028 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 14:27:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:08,029 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 14:27:08,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:27:08,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-08 14:27:08,059 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 14:27:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:27:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:27:08,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:08,063 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:08,079 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 14:27:08,279 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 14:27:08,279 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-08 14:27:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:08,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481694950] [2022-04-08 14:27:08,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-08 14:27:08,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:08,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553546299] [2022-04-08 14:27:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:08,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:08,296 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:08,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396170613] [2022-04-08 14:27:08,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:27:08,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:08,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:08,299 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 14:27:08,300 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 14:27:08,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:27:08,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:27:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:08,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:08,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:27:08,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-08 14:27:08,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:08,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:27:08,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:27:08,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-08 14:27:08,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-08 14:27:08,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:27:08,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:27:08,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:08,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:27:08,517 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:27:08,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:27:08,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:27:08,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:08,518 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:27:08,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:08,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:08,519 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:27:08,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:27:08,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:27:08,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:08,520 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:08,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:27:08,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:27:08,522 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:08,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:08,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:27:08,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:27:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:27:08,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:10,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:27:10,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:27:10,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:10,919 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:10,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:27:11,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:27:11,488 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:27:11,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:11,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:27:11,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:27:11,489 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:27:11,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:27:11,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:27:11,490 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:27:11,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:11,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:27:11,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:27:11,491 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:27:11,491 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:27:11,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:11,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:27:11,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:27:11,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {512#true} is VALID [2022-04-08 14:27:11,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-08 14:27:11,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:27:11,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:27:11,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:27:11,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-08 14:27:11,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:27:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:27:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:11,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553546299] [2022-04-08 14:27:11,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:11,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396170613] [2022-04-08 14:27:11,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396170613] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:11,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:11,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:27:11,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:11,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481694950] [2022-04-08 14:27:11,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481694950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:11,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:11,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:27:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796550018] [2022-04-08 14:27:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 14:27:11,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:11,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:27:12,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:12,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:27:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:27:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:27:12,555 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:27:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:12,668 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 14:27:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:27:12,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 14:27:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:27:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:27:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:27:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:27:12,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:27:13,252 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 14:27:13,253 INFO L225 Difference]: With dead ends: 37 [2022-04-08 14:27:13,253 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 14:27:13,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:27:13,256 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:13,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:27:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 14:27:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 14:27:13,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:13,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:13,269 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:13,270 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:13,271 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:27:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:27:13,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:13,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:13,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 14:27:13,272 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 14:27:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:13,273 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:27:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:27:13,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:13,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:13,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:13,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:27:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 14:27:13,274 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 14:27:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:13,275 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 14:27:13,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:27:13,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 14:27:15,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:27:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:27:15,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:15,310 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:15,326 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 14:27:15,510 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 14:27:15,510 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-08 14:27:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:15,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615696777] [2022-04-08 14:27:15,511 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-08 14:27:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:15,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440584604] [2022-04-08 14:27:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:15,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:15,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512271769] [2022-04-08 14:27:15,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:27:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:15,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:15,529 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 14:27:15,530 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 14:27:15,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:27:15,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:15,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:27:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:15,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:15,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 14:27:15,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {900#true} is VALID [2022-04-08 14:27:15,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:27:15,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-08 14:27:15,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-08 14:27:15,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {900#true} is VALID [2022-04-08 14:27:15,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {900#true} is VALID [2022-04-08 14:27:15,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:27:15,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:27:15,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:27:15,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-08 14:27:15,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-08 14:27:15,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:27:15,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:27:15,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:27:15,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-08 14:27:15,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:15,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:15,803 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:27:15,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:27:15,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:27:15,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:27:15,804 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:15,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:27:15,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:27:15,805 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:27:15,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:27:15,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:27:15,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:27:15,806 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:27:15,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:27:15,806 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:27:15,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:27:15,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:27:15,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:27:15,807 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:27:15,808 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:15,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:15,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-08 14:27:15,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 14:27:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 14:27:15,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:16,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:16,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440584604] [2022-04-08 14:27:16,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:16,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512271769] [2022-04-08 14:27:16,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512271769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:16,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:16,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:27:16,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:16,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615696777] [2022-04-08 14:27:16,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615696777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:16,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:16,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:27:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576963031] [2022-04-08 14:27:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:27:16,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:16,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:27:16,086 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 14:27:16,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:27:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:27:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:27:16,087 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:27:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:16,294 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:27:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:27:16,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:27:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:27:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:27:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:27:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:27:16,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 14:27:16,325 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 14:27:16,326 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:27:16,326 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:27:16,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:27:16,327 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:16,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:27:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:27:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:27:16,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:16,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:27:16,344 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:27:16,345 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:27:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:16,346 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:27:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:27:16,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:16,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:16,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 14:27:16,347 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 14:27:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:16,348 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:27:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:27:16,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:16,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:16,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:16,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:27:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 14:27:16,351 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 14:27:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:16,351 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 14:27:16,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:27:16,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-08 14:27:16,657 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 14:27:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:27:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:27:16,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:16,658 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:16,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 14:27:16,871 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 14:27:16,871 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-08 14:27:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:16,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085776077] [2022-04-08 14:27:16,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-08 14:27:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:16,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928311257] [2022-04-08 14:27:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:16,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:16,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613184025] [2022-04-08 14:27:16,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:27:16,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:16,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:16,884 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 14:27:16,888 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 14:27:16,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:27:16,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:16,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 14:27:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:16,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:17,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-08 14:27:17,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-08 14:27:17,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-08 14:27:17,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-08 14:27:17,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1315#true} is VALID [2022-04-08 14:27:17,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,198 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-08 14:27:17,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:17,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:17,208 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:27:17,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:27:17,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:27:17,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,210 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:17,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:27:17,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:27:17,210 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:27:17,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:27:17,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:27:17,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,211 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:27:17,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 14:27:17,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 14:27:17,212 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:27:17,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:27:17,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:27:17,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,213 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 14:27:17,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-08 14:27:17,214 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:27:17,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:27:17,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:27:17,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:27:17,214 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-08 14:27:17,215 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:17,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:17,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-08 14:27:17,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-08 14:27:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 14:27:17,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:17,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928311257] [2022-04-08 14:27:17,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:17,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613184025] [2022-04-08 14:27:17,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613184025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:17,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:17,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:27:17,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:17,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085776077] [2022-04-08 14:27:17,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085776077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:17,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:27:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943445785] [2022-04-08 14:27:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:27:17,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:17,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:27:17,518 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 14:27:17,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:27:17,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:27:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:27:17,519 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:27:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:17,766 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:27:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:27:17,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:27:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:27:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:27:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:27:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:27:17,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 14:27:17,800 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 14:27:17,801 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:27:17,801 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:27:17,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:27:17,802 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:17,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:27:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:27:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:27:17,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:17,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:27:17,820 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:27:17,820 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:27:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:17,821 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:27:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:27:17,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:17,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:17,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 14:27:17,822 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 14:27:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:17,823 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:27:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:27:17,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:17,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:17,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:17,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:27:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 14:27:17,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 14:27:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:17,825 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 14:27:17,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:27:17,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-08 14:27:18,183 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 14:27:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:27:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 14:27:18,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:18,194 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:18,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 14:27:18,395 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 14:27:18,395 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:18,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-08 14:27:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:18,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594302128] [2022-04-08 14:27:18,397 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-08 14:27:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:18,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823738941] [2022-04-08 14:27:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:18,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162627388] [2022-04-08 14:27:18,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:27:18,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:18,426 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 14:27:18,427 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 14:27:18,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:27:18,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:27:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:18,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:19,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-08 14:27:19,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1770#true} is VALID [2022-04-08 14:27:19,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1770#true} {1770#true} #53#return; {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L272 TraceCheckUtils]: 11: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1770#true} #55#return; {1770#true} is VALID [2022-04-08 14:27:19,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:19,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:19,043 INFO L272 TraceCheckUtils]: 18: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,043 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1823#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1823#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:19,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:27:19,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:27:19,044 INFO L272 TraceCheckUtils]: 25: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,045 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:27:19,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {1845#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:19,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:19,046 INFO L272 TraceCheckUtils]: 32: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,047 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:19,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {1867#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:27:19,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:27:19,047 INFO L272 TraceCheckUtils]: 39: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,048 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:27:19,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {1889#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:27:19,049 INFO L272 TraceCheckUtils]: 45: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1770#true} is VALID [2022-04-08 14:27:19,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-08 14:27:19,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-08 14:27:19,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-08 14:27:19,050 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:27:19,055 INFO L272 TraceCheckUtils]: 50: Hoare triple {1911#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:19,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {1930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:19,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {1934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1771#false} is VALID [2022-04-08 14:27:19,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-08 14:27:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 14:27:19,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:19,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823738941] [2022-04-08 14:27:19,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:19,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162627388] [2022-04-08 14:27:19,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162627388] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:19,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:19,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:27:19,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:19,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594302128] [2022-04-08 14:27:19,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594302128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:19,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:19,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:27:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488213823] [2022-04-08 14:27:19,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 14:27:19,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:19,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:27:19,327 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 14:27:19,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:27:19,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:19,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:27:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:27:19,328 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:27:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:19,657 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 14:27:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:27:19,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 14:27:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:27:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 14:27:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:27:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 14:27:19,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 14:27:19,696 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 14:27:19,697 INFO L225 Difference]: With dead ends: 48 [2022-04-08 14:27:19,697 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 14:27:19,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:27:19,698 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:19,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:27:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 14:27:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 14:27:19,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:19,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:27:19,717 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:27:19,717 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:27:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:19,719 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 14:27:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:27:19,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:19,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:19,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 14:27:19,720 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 14:27:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:19,721 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 14:27:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:27:19,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:19,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:19,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:19,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:27:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 14:27:19,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-08 14:27:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:19,724 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 14:27:19,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:27:19,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 14:27:20,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:20,116 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:27:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:27:20,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:20,117 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:20,122 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 14:27:20,317 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 14:27:20,318 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-08 14:27:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:20,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2102973819] [2022-04-08 14:27:20,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-08 14:27:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:20,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977775182] [2022-04-08 14:27:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:20,328 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:20,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756531473] [2022-04-08 14:27:20,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:27:20,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:20,330 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 14:27:20,330 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 14:27:21,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:27:21,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:21,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 14:27:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:21,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:21,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {2265#true} call ULTIMATE.init(); {2265#true} is VALID [2022-04-08 14:27:21,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {2265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2265#true} is VALID [2022-04-08 14:27:21,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2265#true} {2265#true} #63#return; {2265#true} is VALID [2022-04-08 14:27:21,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {2265#true} call #t~ret5 := main(); {2265#true} is VALID [2022-04-08 14:27:21,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {2265#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2265#true} is VALID [2022-04-08 14:27:21,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2265#true} {2265#true} #53#return; {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L272 TraceCheckUtils]: 11: Hoare triple {2265#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,493 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2265#true} {2265#true} #55#return; {2265#true} is VALID [2022-04-08 14:27:21,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {2265#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:21,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:21,494 INFO L272 TraceCheckUtils]: 18: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,495 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2265#true} {2318#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2318#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:21,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {2318#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:27:21,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:27:21,496 INFO L272 TraceCheckUtils]: 25: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,497 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2265#true} {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:27:21,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {2340#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:21,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:21,498 INFO L272 TraceCheckUtils]: 32: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,499 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2265#true} {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:21,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {2362#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:27:21,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:27:21,500 INFO L272 TraceCheckUtils]: 39: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,502 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2265#true} {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:27:21,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {2384#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:27:21,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:27:21,503 INFO L272 TraceCheckUtils]: 46: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,505 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2265#true} {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:27:21,505 INFO L290 TraceCheckUtils]: 51: Hoare triple {2406#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:27:21,505 INFO L272 TraceCheckUtils]: 52: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2265#true} is VALID [2022-04-08 14:27:21,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {2265#true} ~cond := #in~cond; {2265#true} is VALID [2022-04-08 14:27:21,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {2265#true} assume !(0 == ~cond); {2265#true} is VALID [2022-04-08 14:27:21,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {2265#true} assume true; {2265#true} is VALID [2022-04-08 14:27:21,506 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2265#true} {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:27:21,507 INFO L272 TraceCheckUtils]: 57: Hoare triple {2428#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:21,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {2447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:21,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {2451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2266#false} is VALID [2022-04-08 14:27:21,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {2266#false} assume !false; {2266#false} is VALID [2022-04-08 14:27:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 14:27:21,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:21,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977775182] [2022-04-08 14:27:21,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:21,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756531473] [2022-04-08 14:27:21,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756531473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:21,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:21,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:27:21,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:21,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2102973819] [2022-04-08 14:27:21,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2102973819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:21,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:21,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:27:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577369859] [2022-04-08 14:27:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:21,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 14:27:21,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:21,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:27:21,801 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 14:27:21,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:27:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:27:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:27:21,802 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:27:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:22,257 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 14:27:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:27:22,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 14:27:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:27:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 14:27:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:27:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 14:27:22,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-08 14:27:22,296 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 14:27:22,297 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:27:22,297 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:27:22,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:27:22,298 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:22,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:27:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:27:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:27:22,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:22,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:27:22,321 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:27:22,321 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:27:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:22,322 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 14:27:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:27:22,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:22,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:22,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 14:27:22,323 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 14:27:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:22,324 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 14:27:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:27:22,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:22,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:22,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:22,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:27:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-08 14:27:22,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-08 14:27:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:22,326 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-08 14:27:22,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:27:22,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-08 14:27:22,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:27:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 14:27:22,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:22,587 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:22,592 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 14:27:22,791 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 14:27:22,791 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-08 14:27:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893738392] [2022-04-08 14:27:22,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-08 14:27:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725722524] [2022-04-08 14:27:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:22,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:22,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940485451] [2022-04-08 14:27:22,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:27:22,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:22,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:22,806 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 14:27:22,807 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 14:27:22,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:27:22,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:22,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:27:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:22,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:23,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {2800#true} call ULTIMATE.init(); {2800#true} is VALID [2022-04-08 14:27:23,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2800#true} is VALID [2022-04-08 14:27:23,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2800#true} {2800#true} #63#return; {2800#true} is VALID [2022-04-08 14:27:23,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {2800#true} call #t~ret5 := main(); {2800#true} is VALID [2022-04-08 14:27:23,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {2800#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2800#true} {2800#true} #53#return; {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L272 TraceCheckUtils]: 11: Hoare triple {2800#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,216 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2800#true} {2800#true} #55#return; {2800#true} is VALID [2022-04-08 14:27:23,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:23,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:23,217 INFO L272 TraceCheckUtils]: 18: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,221 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2800#true} {2853#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2853#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:23,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:27:23,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:27:23,222 INFO L272 TraceCheckUtils]: 25: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,223 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2800#true} {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:27:23,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {2875#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:27:23,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:27:23,224 INFO L272 TraceCheckUtils]: 32: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,225 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2800#true} {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:27:23,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {2897#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:27:23,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:27:23,225 INFO L272 TraceCheckUtils]: 39: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,226 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2800#true} {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:27:23,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {2919#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:23,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:23,227 INFO L272 TraceCheckUtils]: 46: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,228 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2800#true} {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:23,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {2941#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:27:23,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:27:23,228 INFO L272 TraceCheckUtils]: 53: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,229 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2800#true} {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:27:23,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {2963#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:27:23,230 INFO L272 TraceCheckUtils]: 59: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2800#true} is VALID [2022-04-08 14:27:23,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {2800#true} ~cond := #in~cond; {2800#true} is VALID [2022-04-08 14:27:23,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {2800#true} assume !(0 == ~cond); {2800#true} is VALID [2022-04-08 14:27:23,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {2800#true} assume true; {2800#true} is VALID [2022-04-08 14:27:23,235 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2800#true} {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:27:23,239 INFO L272 TraceCheckUtils]: 64: Hoare triple {2985#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:23,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {3004#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3008#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:23,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {3008#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2801#false} is VALID [2022-04-08 14:27:23,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {2801#false} assume !false; {2801#false} is VALID [2022-04-08 14:27:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 14:27:23,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:23,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:23,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725722524] [2022-04-08 14:27:23,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:23,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940485451] [2022-04-08 14:27:23,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940485451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:23,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:23,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:27:23,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:23,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893738392] [2022-04-08 14:27:23,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893738392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:23,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:23,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:27:23,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888705291] [2022-04-08 14:27:23,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 14:27:23,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:23,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:27:23,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:23,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:27:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:27:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:27:23,548 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:27:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:24,059 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 14:27:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:27:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 14:27:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:27:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 14:27:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:27:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 14:27:24,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 14:27:24,119 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 14:27:24,120 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:27:24,120 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 14:27:24,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:27:24,121 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:24,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:27:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 14:27:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 14:27:24,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:24,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:27:24,143 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:27:24,143 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:27:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:24,144 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 14:27:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:27:24,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:24,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:24,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 14:27:24,145 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 14:27:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:24,146 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 14:27:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:27:24,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:24,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:24,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:24,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:27:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 14:27:24,147 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-08 14:27:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:24,148 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 14:27:24,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:27:24,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-08 14:27:24,453 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 14:27:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:27:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 14:27:24,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:24,454 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:24,469 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 14:27:24,659 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 14:27:24,659 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-08 14:27:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434540786] [2022-04-08 14:27:24,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-08 14:27:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:24,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324534974] [2022-04-08 14:27:24,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:24,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:24,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985073484] [2022-04-08 14:27:24,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:27:24,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:24,691 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 14:27:24,693 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 14:27:36,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:27:36,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:36,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 14:27:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:36,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:37,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {3375#true} call ULTIMATE.init(); {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {3375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3375#true} {3375#true} #63#return; {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {3375#true} call #t~ret5 := main(); {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {3375#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3375#true} {3375#true} #53#return; {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L272 TraceCheckUtils]: 11: Hoare triple {3375#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3375#true} {3375#true} #55#return; {3375#true} is VALID [2022-04-08 14:27:37,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {3375#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:37,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:37,159 INFO L272 TraceCheckUtils]: 18: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,160 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3375#true} {3428#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3428#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:37,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:27:37,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:27:37,161 INFO L272 TraceCheckUtils]: 25: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,161 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3375#true} {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:27:37,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {3450#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:27:37,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:27:37,162 INFO L272 TraceCheckUtils]: 32: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,163 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3375#true} {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:27:37,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {3472#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:27:37,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:27:37,163 INFO L272 TraceCheckUtils]: 39: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,164 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3375#true} {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:27:37,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {3494#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:27:37,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:27:37,165 INFO L272 TraceCheckUtils]: 46: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,166 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3375#true} {3516#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3516#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:27:37,166 INFO L290 TraceCheckUtils]: 51: Hoare triple {3516#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:37,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:37,166 INFO L272 TraceCheckUtils]: 53: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,167 INFO L290 TraceCheckUtils]: 56: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,167 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3375#true} {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:37,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {3538#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:27:37,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:27:37,168 INFO L272 TraceCheckUtils]: 60: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,169 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3375#true} {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:27:37,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {3560#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:27:37,169 INFO L272 TraceCheckUtils]: 66: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3375#true} is VALID [2022-04-08 14:27:37,169 INFO L290 TraceCheckUtils]: 67: Hoare triple {3375#true} ~cond := #in~cond; {3375#true} is VALID [2022-04-08 14:27:37,169 INFO L290 TraceCheckUtils]: 68: Hoare triple {3375#true} assume !(0 == ~cond); {3375#true} is VALID [2022-04-08 14:27:37,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {3375#true} assume true; {3375#true} is VALID [2022-04-08 14:27:37,170 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3375#true} {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:27:37,170 INFO L272 TraceCheckUtils]: 71: Hoare triple {3582#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:37,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {3601#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3605#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:37,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {3605#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3376#false} is VALID [2022-04-08 14:27:37,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {3376#false} assume !false; {3376#false} is VALID [2022-04-08 14:27:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 14:27:37,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:37,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324534974] [2022-04-08 14:27:37,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:37,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985073484] [2022-04-08 14:27:37,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985073484] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:37,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:37,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:27:37,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:37,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434540786] [2022-04-08 14:27:37,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434540786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:37,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:37,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:27:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685914552] [2022-04-08 14:27:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:37,463 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 14:27:37,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:37,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:27:37,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:37,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:27:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:27:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:27:37,497 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:27:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:38,089 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 14:27:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:27:38,089 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 14:27:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:27:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 14:27:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:27:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 14:27:38,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-08 14:27:38,133 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 14:27:38,134 INFO L225 Difference]: With dead ends: 57 [2022-04-08 14:27:38,134 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 14:27:38,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:27:38,135 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:38,135 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:27:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 14:27:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 14:27:38,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:38,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:27:38,163 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:27:38,164 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:27:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:38,165 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 14:27:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 14:27:38,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:38,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:38,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 14:27:38,166 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 14:27:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:38,167 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 14:27:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 14:27:38,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:38,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:38,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:38,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:27:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-08 14:27:38,169 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-08 14:27:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:38,169 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-08 14:27:38,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:27:38,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-08 14:27:38,863 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 14:27:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 14:27:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 14:27:38,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:38,865 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:38,875 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 14:27:39,075 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 14:27:39,075 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-08 14:27:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:39,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1549489063] [2022-04-08 14:27:39,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-08 14:27:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:39,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122051111] [2022-04-08 14:27:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:39,089 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:39,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546174552] [2022-04-08 14:27:39,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:27:39,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:39,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:39,090 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 14:27:39,091 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 14:27:46,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:27:46,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:46,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:27:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:46,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:47,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-08 14:27:47,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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); {3990#true} is VALID [2022-04-08 14:27:47,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #63#return; {3990#true} is VALID [2022-04-08 14:27:47,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret5 := main(); {3990#true} is VALID [2022-04-08 14:27:47,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#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; {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L272 TraceCheckUtils]: 6: Hoare triple {3990#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3990#true} {3990#true} #53#return; {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L272 TraceCheckUtils]: 11: Hoare triple {3990#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,136 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3990#true} {3990#true} #55#return; {3990#true} is VALID [2022-04-08 14:27:47,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {3990#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4043#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:47,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {4043#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4043#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:47,137 INFO L272 TraceCheckUtils]: 18: Hoare triple {4043#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,138 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3990#true} {4043#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4043#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:47,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {4043#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:27:47,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:27:47,139 INFO L272 TraceCheckUtils]: 25: Hoare triple {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,140 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3990#true} {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:27:47,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {4065#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:47,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:47,140 INFO L272 TraceCheckUtils]: 32: Hoare triple {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,141 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3990#true} {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:47,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {4087#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4109#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:27:47,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {4109#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4109#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:27:47,142 INFO L272 TraceCheckUtils]: 39: Hoare triple {4109#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,142 INFO L290 TraceCheckUtils]: 41: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,143 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3990#true} {4109#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4109#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:27:47,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {4109#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:27:47,143 INFO L290 TraceCheckUtils]: 45: Hoare triple {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:27:47,143 INFO L272 TraceCheckUtils]: 46: Hoare triple {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,144 INFO L290 TraceCheckUtils]: 47: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,144 INFO L290 TraceCheckUtils]: 48: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,144 INFO L290 TraceCheckUtils]: 49: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,144 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3990#true} {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #57#return; {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:27:47,145 INFO L290 TraceCheckUtils]: 51: Hoare triple {4131#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:47,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:47,145 INFO L272 TraceCheckUtils]: 53: Hoare triple {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,145 INFO L290 TraceCheckUtils]: 54: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,145 INFO L290 TraceCheckUtils]: 55: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,146 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3990#true} {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:47,146 INFO L290 TraceCheckUtils]: 58: Hoare triple {4153#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:47,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:47,147 INFO L272 TraceCheckUtils]: 60: Hoare triple {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,147 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3990#true} {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:47,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {4175#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 14:27:47,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 14:27:47,148 INFO L272 TraceCheckUtils]: 67: Hoare triple {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,149 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3990#true} {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #57#return; {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 14:27:47,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {4197#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 14:27:47,150 INFO L272 TraceCheckUtils]: 73: Hoare triple {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3990#true} is VALID [2022-04-08 14:27:47,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {3990#true} ~cond := #in~cond; {3990#true} is VALID [2022-04-08 14:27:47,150 INFO L290 TraceCheckUtils]: 75: Hoare triple {3990#true} assume !(0 == ~cond); {3990#true} is VALID [2022-04-08 14:27:47,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-08 14:27:47,150 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3990#true} {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #59#return; {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 14:27:47,151 INFO L272 TraceCheckUtils]: 78: Hoare triple {4219#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:47,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {4238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:47,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {4242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-08 14:27:47,151 INFO L290 TraceCheckUtils]: 81: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-08 14:27:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 14:27:47,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122051111] [2022-04-08 14:27:47,392 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546174552] [2022-04-08 14:27:47,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546174552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:47,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:47,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:27:47,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:47,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1549489063] [2022-04-08 14:27:47,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1549489063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:47,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:47,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:27:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306898855] [2022-04-08 14:27:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 14:27:47,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:47,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:27:47,428 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 14:27:47,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:27:47,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:47,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:27:47,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:27:47,429 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:27:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:48,104 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 14:27:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:27:48,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 14:27:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:27:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 14:27:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:27:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 14:27:48,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-08 14:27:48,154 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 14:27:48,154 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:27:48,154 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 14:27:48,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:27:48,155 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:48,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:27:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 14:27:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 14:27:48,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:48,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:27:48,205 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:27:48,205 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:27:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:48,207 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 14:27:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 14:27:48,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:48,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:48,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 14:27:48,207 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 14:27:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:48,208 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 14:27:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 14:27:48,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:48,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:48,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:48,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:27:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 14:27:48,211 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-08 14:27:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:48,211 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 14:27:48,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:27:48,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 14:27:48,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 14:27:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 14:27:48,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:48,652 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:48,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 14:27:48,852 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 14:27:48,852 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-08 14:27:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758748204] [2022-04-08 14:27:48,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-08 14:27:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714450984] [2022-04-08 14:27:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:48,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:48,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663505083] [2022-04-08 14:27:48,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:27:48,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:48,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:48,868 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 14:27:48,874 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 14:27:48,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:27:48,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:27:48,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:27:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:27:48,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:27:49,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {4645#true} call ULTIMATE.init(); {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {4645#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); {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4645#true} {4645#true} #63#return; {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {4645#true} call #t~ret5 := main(); {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {4645#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; {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {4645#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4645#true} {4645#true} #53#return; {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {4645#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,445 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4645#true} {4645#true} #55#return; {4645#true} is VALID [2022-04-08 14:27:49,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {4645#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:49,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:49,445 INFO L272 TraceCheckUtils]: 18: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,446 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4645#true} {4698#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4698#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:27:49,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {4698#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:27:49,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:27:49,447 INFO L272 TraceCheckUtils]: 25: Hoare triple {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,448 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4645#true} {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:27:49,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {4720#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:27:49,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:27:49,448 INFO L272 TraceCheckUtils]: 32: Hoare triple {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,449 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4645#true} {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:27:49,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {4742#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4764#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:27:49,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {4764#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4764#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:27:49,450 INFO L272 TraceCheckUtils]: 39: Hoare triple {4764#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,451 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4645#true} {4764#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4764#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:27:49,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {4764#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:49,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:49,452 INFO L272 TraceCheckUtils]: 46: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,452 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4645#true} {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:27:49,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {4786#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:49,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:49,453 INFO L272 TraceCheckUtils]: 53: Hoare triple {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,462 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4645#true} {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:27:49,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {4808#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:27:49,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:27:49,463 INFO L272 TraceCheckUtils]: 60: Hoare triple {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,464 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4645#true} {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {4830#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:27:49,464 INFO L290 TraceCheckUtils]: 65: Hoare triple {4830#(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 * ~y~0 + ~x~0; {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:49,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:49,464 INFO L272 TraceCheckUtils]: 67: Hoare triple {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,465 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4645#true} {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:27:49,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {4852#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:27:49,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:27:49,466 INFO L272 TraceCheckUtils]: 74: Hoare triple {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,466 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4645#true} {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:27:49,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {4874#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:27:49,467 INFO L272 TraceCheckUtils]: 80: Hoare triple {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4645#true} is VALID [2022-04-08 14:27:49,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {4645#true} ~cond := #in~cond; {4645#true} is VALID [2022-04-08 14:27:49,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {4645#true} assume !(0 == ~cond); {4645#true} is VALID [2022-04-08 14:27:49,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {4645#true} assume true; {4645#true} is VALID [2022-04-08 14:27:49,468 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4645#true} {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:27:49,468 INFO L272 TraceCheckUtils]: 85: Hoare triple {4896#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4915#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:27:49,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {4915#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4919#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:27:49,469 INFO L290 TraceCheckUtils]: 87: Hoare triple {4919#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4646#false} is VALID [2022-04-08 14:27:49,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {4646#false} assume !false; {4646#false} is VALID [2022-04-08 14:27:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 14:27:49,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:27:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:27:49,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714450984] [2022-04-08 14:27:49,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:27:49,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663505083] [2022-04-08 14:27:49,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663505083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:27:49,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:27:49,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:27:49,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:27:49,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758748204] [2022-04-08 14:27:49,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758748204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:27:49,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:27:49,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:27:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822056077] [2022-04-08 14:27:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:27:49,711 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 14:27:49,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:27:49,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:27:49,753 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 14:27:49,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:27:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:27:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:27:49,754 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:27:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:50,586 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 14:27:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:27:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 14:27:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:27:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:27:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 14:27:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:27:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 14:27:50,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-08 14:27:50,640 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 14:27:50,640 INFO L225 Difference]: With dead ends: 63 [2022-04-08 14:27:50,640 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 14:27:50,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:27:50,641 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:27:50,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:27:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 14:27:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 14:27:50,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:27:50,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:27:50,679 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:27:50,679 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:27:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:50,681 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 14:27:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 14:27:50,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:50,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:50,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 14:27:50,681 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 14:27:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:27:50,682 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 14:27:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 14:27:50,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:27:50,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:27:50,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:27:50,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:27:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:27:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-08 14:27:50,687 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-08 14:27:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:27:50,687 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-08 14:27:50,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:27:50,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-08 14:27:51,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:27:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 14:27:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 14:27:51,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:27:51,190 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:27:51,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 14:27:51,395 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 14:27:51,395 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:27:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:27:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-08 14:27:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:27:51,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61992870] [2022-04-08 14:27:51,398 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:27:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-08 14:27:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:27:51,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780797264] [2022-04-08 14:27:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:27:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:27:51,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:27:51,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010359133] [2022-04-08 14:27:51,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:27:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:27:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:27:51,411 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 14:27:51,412 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 14:30:38,818 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 14:30:38,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:30:38,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 14:30:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:30:38,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:30:39,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {5340#true} call ULTIMATE.init(); {5340#true} is VALID [2022-04-08 14:30:39,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {5340#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); {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5340#true} {5340#true} #63#return; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {5340#true} call #t~ret5 := main(); {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {5340#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; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {5340#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5340#true} {5340#true} #53#return; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {5340#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5340#true} {5340#true} #55#return; {5340#true} is VALID [2022-04-08 14:30:39,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {5340#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:30:39,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {5393#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:30:39,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {5393#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,300 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5340#true} {5393#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {5393#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:30:39,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {5393#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:30:39,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:30:39,301 INFO L272 TraceCheckUtils]: 25: Hoare triple {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,301 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5340#true} {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:30:39,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {5415#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5437#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:30:39,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {5437#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5437#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:30:39,302 INFO L272 TraceCheckUtils]: 32: Hoare triple {5437#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,303 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5340#true} {5437#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {5437#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:30:39,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {5437#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:30:39,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:30:39,304 INFO L272 TraceCheckUtils]: 39: Hoare triple {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,304 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5340#true} {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:30:39,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {5459#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:30:39,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:30:39,305 INFO L272 TraceCheckUtils]: 46: Hoare triple {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,306 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5340#true} {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:30:39,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {5481#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:30:39,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:30:39,306 INFO L272 TraceCheckUtils]: 53: Hoare triple {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,307 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {5340#true} {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:30:39,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {5503#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5525#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:30:39,308 INFO L290 TraceCheckUtils]: 59: Hoare triple {5525#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {5525#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:30:39,308 INFO L272 TraceCheckUtils]: 60: Hoare triple {5525#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,308 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5340#true} {5525#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {5525#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:30:39,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {5525#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:30:39,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:30:39,309 INFO L272 TraceCheckUtils]: 67: Hoare triple {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,310 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5340#true} {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #57#return; {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-08 14:30:39,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {5547#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:30:39,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !false; {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:30:39,310 INFO L272 TraceCheckUtils]: 74: Hoare triple {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,310 INFO L290 TraceCheckUtils]: 75: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,311 INFO L290 TraceCheckUtils]: 76: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,311 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {5340#true} {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} #57#return; {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:30:39,311 INFO L290 TraceCheckUtils]: 79: Hoare triple {5569#(and (= 6 (+ (- 2) main_~c~0)) (= 7 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:30:39,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:30:39,312 INFO L272 TraceCheckUtils]: 81: Hoare triple {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,312 INFO L290 TraceCheckUtils]: 84: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,312 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {5340#true} {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #57#return; {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:30:39,313 INFO L290 TraceCheckUtils]: 86: Hoare triple {5591#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:30:39,313 INFO L272 TraceCheckUtils]: 87: Hoare triple {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {5340#true} is VALID [2022-04-08 14:30:39,313 INFO L290 TraceCheckUtils]: 88: Hoare triple {5340#true} ~cond := #in~cond; {5340#true} is VALID [2022-04-08 14:30:39,313 INFO L290 TraceCheckUtils]: 89: Hoare triple {5340#true} assume !(0 == ~cond); {5340#true} is VALID [2022-04-08 14:30:39,313 INFO L290 TraceCheckUtils]: 90: Hoare triple {5340#true} assume true; {5340#true} is VALID [2022-04-08 14:30:39,314 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {5340#true} {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #59#return; {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:30:39,314 INFO L272 TraceCheckUtils]: 92: Hoare triple {5613#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5632#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:30:39,314 INFO L290 TraceCheckUtils]: 93: Hoare triple {5632#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5636#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:30:39,315 INFO L290 TraceCheckUtils]: 94: Hoare triple {5636#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5341#false} is VALID [2022-04-08 14:30:39,315 INFO L290 TraceCheckUtils]: 95: Hoare triple {5341#false} assume !false; {5341#false} is VALID [2022-04-08 14:30:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 14:30:39,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:30:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:30:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780797264] [2022-04-08 14:30:39,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:30:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010359133] [2022-04-08 14:30:39,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010359133] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:30:39,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:30:39,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 14:30:39,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:30:39,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61992870] [2022-04-08 14:30:39,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61992870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:30:39,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:30:39,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:30:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898733466] [2022-04-08 14:30:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:30:39,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-08 14:30:39,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:30:39,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 14:30:39,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:30:39,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:30:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:30:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:30:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:30:39,597 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 14:30:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:30:40,564 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-08 14:30:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 14:30:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) Word has length 96 [2022-04-08 14:30:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:30:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 14:30:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-08 14:30:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 14:30:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 74 transitions. [2022-04-08 14:30:40,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 74 transitions. [2022-04-08 14:30:40,617 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 14:30:40,618 INFO L225 Difference]: With dead ends: 66 [2022-04-08 14:30:40,618 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 14:30:40,618 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:30:40,619 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:30:40,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:30:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 14:30:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 14:30:40,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:30:40,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:30:40,652 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:30:40,652 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:30:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:30:40,654 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 14:30:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 14:30:40,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:30:40,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:30:40,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-08 14:30:40,654 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 60 states. [2022-04-08 14:30:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:30:40,655 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 14:30:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 14:30:40,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:30:40,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:30:40,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:30:40,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:30:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 17 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:30:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-04-08 14:30:40,657 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 96 [2022-04-08 14:30:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:30:40,657 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-04-08 14:30:40,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 12 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-04-08 14:30:40,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 71 transitions. [2022-04-08 14:30:41,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:30:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 14:30:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 14:30:41,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:30:41,047 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:30:41,075 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 14:30:41,247 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 14:30:41,247 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:30:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:30:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 19 times [2022-04-08 14:30:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:30:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1930022817] [2022-04-08 14:30:41,248 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:30:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1610181715, now seen corresponding path program 20 times [2022-04-08 14:30:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:30:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024985367] [2022-04-08 14:30:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:30:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:30:41,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:30:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218079068] [2022-04-08 14:30:41,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:30:41,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:30:41,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:30:41,264 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 14:30:41,265 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 14:32:58,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:58,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:58,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 14:32:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:58,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:58,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {6075#true} call ULTIMATE.init(); {6075#true} is VALID [2022-04-08 14:32:58,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {6075#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); {6075#true} is VALID [2022-04-08 14:32:58,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6075#true} {6075#true} #63#return; {6075#true} is VALID [2022-04-08 14:32:58,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {6075#true} call #t~ret5 := main(); {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {6075#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; {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L272 TraceCheckUtils]: 6: Hoare triple {6075#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6075#true} {6075#true} #53#return; {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L272 TraceCheckUtils]: 11: Hoare triple {6075#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6075#true} {6075#true} #55#return; {6075#true} is VALID [2022-04-08 14:32:58,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {6075#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6128#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {6128#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,987 INFO L272 TraceCheckUtils]: 18: Hoare triple {6128#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,988 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6075#true} {6128#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {6128#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:58,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:58,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:58,989 INFO L272 TraceCheckUtils]: 25: Hoare triple {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,989 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6075#true} {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {6150#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:32:58,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {6150#(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 * ~y~0 + ~x~0; {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,990 INFO L272 TraceCheckUtils]: 32: Hoare triple {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,991 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6075#true} {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} #57#return; {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {6172#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !false; {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,992 INFO L272 TraceCheckUtils]: 39: Hoare triple {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,993 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6075#true} {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #57#return; {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {6194#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !false; {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,994 INFO L272 TraceCheckUtils]: 46: Hoare triple {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,994 INFO L290 TraceCheckUtils]: 47: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,995 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6075#true} {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} #57#return; {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,995 INFO L290 TraceCheckUtils]: 51: Hoare triple {6216#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,996 INFO L290 TraceCheckUtils]: 52: Hoare triple {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} assume !false; {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,996 INFO L272 TraceCheckUtils]: 53: Hoare triple {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,996 INFO L290 TraceCheckUtils]: 55: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,996 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6075#true} {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} #57#return; {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {6238#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,997 INFO L290 TraceCheckUtils]: 59: Hoare triple {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !false; {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,997 INFO L272 TraceCheckUtils]: 60: Hoare triple {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,998 INFO L290 TraceCheckUtils]: 63: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:58,998 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6075#true} {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} #57#return; {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,999 INFO L290 TraceCheckUtils]: 65: Hoare triple {6260#(and (= main_~y~0 6) (= main_~c~0 6) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,999 INFO L290 TraceCheckUtils]: 66: Hoare triple {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !false; {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:58,999 INFO L272 TraceCheckUtils]: 67: Hoare triple {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:58,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:58,999 INFO L290 TraceCheckUtils]: 69: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:58,999 INFO L290 TraceCheckUtils]: 70: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:59,000 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6075#true} {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} #57#return; {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {6282#(and (= 7 main_~y~0) (= 7 main_~c~0) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !false; {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,001 INFO L272 TraceCheckUtils]: 74: Hoare triple {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:59,001 INFO L290 TraceCheckUtils]: 75: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:59,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:59,001 INFO L290 TraceCheckUtils]: 77: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:59,001 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {6075#true} {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} #57#return; {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,002 INFO L290 TraceCheckUtils]: 79: Hoare triple {6304#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,002 INFO L290 TraceCheckUtils]: 80: Hoare triple {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !false; {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,002 INFO L272 TraceCheckUtils]: 81: Hoare triple {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:59,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:59,003 INFO L290 TraceCheckUtils]: 83: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:59,003 INFO L290 TraceCheckUtils]: 84: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:59,003 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {6075#true} {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} #57#return; {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 14:32:59,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {6326#(and (= main_~y~0 9) (= main_~c~0 9) (< 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:32:59,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !false; {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:32:59,004 INFO L272 TraceCheckUtils]: 88: Hoare triple {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:59,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:59,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:59,004 INFO L290 TraceCheckUtils]: 91: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:59,005 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {6075#true} {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} #57#return; {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:32:59,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {6348#(and (= main_~y~0 10) (<= main_~c~0 10) (< 9 main_~k~0))} assume !(~c~0 < ~k~0); {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:32:59,005 INFO L272 TraceCheckUtils]: 94: Hoare triple {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {6075#true} is VALID [2022-04-08 14:32:59,006 INFO L290 TraceCheckUtils]: 95: Hoare triple {6075#true} ~cond := #in~cond; {6075#true} is VALID [2022-04-08 14:32:59,006 INFO L290 TraceCheckUtils]: 96: Hoare triple {6075#true} assume !(0 == ~cond); {6075#true} is VALID [2022-04-08 14:32:59,006 INFO L290 TraceCheckUtils]: 97: Hoare triple {6075#true} assume true; {6075#true} is VALID [2022-04-08 14:32:59,006 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {6075#true} {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} #59#return; {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} is VALID [2022-04-08 14:32:59,007 INFO L272 TraceCheckUtils]: 99: Hoare triple {6370#(and (<= main_~k~0 10) (= main_~y~0 10) (< 9 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6389#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:32:59,008 INFO L290 TraceCheckUtils]: 100: Hoare triple {6389#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6393#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:59,008 INFO L290 TraceCheckUtils]: 101: Hoare triple {6393#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6076#false} is VALID [2022-04-08 14:32:59,009 INFO L290 TraceCheckUtils]: 102: Hoare triple {6076#false} assume !false; {6076#false} is VALID [2022-04-08 14:32:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 14:32:59,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:59,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:59,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024985367] [2022-04-08 14:32:59,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:59,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218079068] [2022-04-08 14:32:59,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218079068] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:59,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:59,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 14:32:59,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:59,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1930022817] [2022-04-08 14:32:59,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1930022817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:59,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:59,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 14:32:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116762259] [2022-04-08 14:32:59,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-08 14:32:59,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:59,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 14:32:59,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:59,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 14:32:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:59,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 14:32:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-04-08 14:32:59,996 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 14:33:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,246 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-08 14:33:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:33:01,246 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 103 [2022-04-08 14:33:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 14:33:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-08 14:33:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 14:33:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 78 transitions. [2022-04-08 14:33:01,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 78 transitions. [2022-04-08 14:33:01,316 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 14:33:01,317 INFO L225 Difference]: With dead ends: 69 [2022-04-08 14:33:01,317 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 14:33:01,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-04-08 14:33:01,318 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:01,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 14:33:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 14:33:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 14:33:01,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:01,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:01,366 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:01,366 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,367 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 14:33:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 14:33:01,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:01,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:01,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-08 14:33:01,369 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-08 14:33:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,370 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-08 14:33:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 14:33:01,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:01,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:01,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:01,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:33:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-04-08 14:33:01,373 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 103 [2022-04-08 14:33:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:01,373 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-04-08 14:33:01,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 13 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-04-08 14:33:01,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 75 transitions. [2022-04-08 14:33:01,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-04-08 14:33:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 14:33:01,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:01,737 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:01,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:01,939 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 14:33:01,939 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 21 times [2022-04-08 14:33:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1731344337] [2022-04-08 14:33:01,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:33:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1881400669, now seen corresponding path program 22 times [2022-04-08 14:33:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34286682] [2022-04-08 14:33:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:01,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916727790] [2022-04-08 14:33:01,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:01,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:01,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:01,958 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 14:33:01,959 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 14:33:02,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:02,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:02,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 14:33:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:02,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:02,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {7048#true} call ULTIMATE.init(); {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {7048#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); {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7048#true} {7048#true} #63#return; {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {7048#true} call #t~ret5 := main(); {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {7048#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; {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L272 TraceCheckUtils]: 6: Hoare triple {7048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7048#true} {7048#true} #53#return; {7048#true} is VALID [2022-04-08 14:33:02,580 INFO L272 TraceCheckUtils]: 11: Hoare triple {7048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,580 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7048#true} {7048#true} #55#return; {7048#true} is VALID [2022-04-08 14:33:02,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {7048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {7101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,584 INFO L272 TraceCheckUtils]: 18: Hoare triple {7101#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,584 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7048#true} {7101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {7101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:02,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {7101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:02,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:02,585 INFO L272 TraceCheckUtils]: 25: Hoare triple {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,586 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7048#true} {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:02,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {7123#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:33:02,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:33:02,586 INFO L272 TraceCheckUtils]: 32: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,587 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7048#true} {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 14:33:02,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {7145#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:02,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:02,588 INFO L272 TraceCheckUtils]: 39: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,588 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7048#true} {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:33:02,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {7167#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:02,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !false; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:02,589 INFO L272 TraceCheckUtils]: 46: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,590 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7048#true} {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} #57#return; {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:33:02,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {7189#(and (= (+ main_~c~0 (- 3)) 1) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 14:33:02,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !false; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 14:33:02,591 INFO L272 TraceCheckUtils]: 53: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,595 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {7048#true} {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} #57#return; {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} is VALID [2022-04-08 14:33:02,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {7211#(and (= (+ (- 2) main_~y~0) 3) (= (+ main_~c~0 (- 4)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 14:33:02,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} assume !false; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 14:33:02,596 INFO L272 TraceCheckUtils]: 60: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,597 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7048#true} {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} #57#return; {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 14:33:02,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {7233#(and (= (+ main_~c~0 (- 5)) 1) (= (+ main_~y~0 (- 3)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 14:33:02,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !false; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 14:33:02,598 INFO L272 TraceCheckUtils]: 67: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,598 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7048#true} {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} #57#return; {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 14:33:02,599 INFO L290 TraceCheckUtils]: 72: Hoare triple {7255#(and (= 7 main_~c~0) (= (+ main_~y~0 (- 4)) 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 14:33:02,599 INFO L290 TraceCheckUtils]: 73: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !false; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 14:33:02,599 INFO L272 TraceCheckUtils]: 74: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,600 INFO L290 TraceCheckUtils]: 76: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,600 INFO L290 TraceCheckUtils]: 77: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,600 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {7048#true} {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} #57#return; {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-08 14:33:02,601 INFO L290 TraceCheckUtils]: 79: Hoare triple {7277#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:02,601 INFO L290 TraceCheckUtils]: 80: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !false; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:02,601 INFO L272 TraceCheckUtils]: 81: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,601 INFO L290 TraceCheckUtils]: 82: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,601 INFO L290 TraceCheckUtils]: 83: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,601 INFO L290 TraceCheckUtils]: 84: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,602 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {7048#true} {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} #57#return; {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:33:02,602 INFO L290 TraceCheckUtils]: 86: Hoare triple {7299#(and (= main_~y~0 9) (= 7 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:33:02,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} assume !false; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:33:02,603 INFO L272 TraceCheckUtils]: 88: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,603 INFO L290 TraceCheckUtils]: 89: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,603 INFO L290 TraceCheckUtils]: 90: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,603 INFO L290 TraceCheckUtils]: 91: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,603 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {7048#true} {7321#(and (= main_~y~0 10) (= main_~c~0 10))} #57#return; {7321#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 14:33:02,604 INFO L290 TraceCheckUtils]: 93: Hoare triple {7321#(and (= main_~y~0 10) (= main_~c~0 10))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:33:02,604 INFO L290 TraceCheckUtils]: 94: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !false; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:33:02,604 INFO L272 TraceCheckUtils]: 95: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,604 INFO L290 TraceCheckUtils]: 96: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,605 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {7048#true} {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} #57#return; {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:33:02,606 INFO L290 TraceCheckUtils]: 100: Hoare triple {7343#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} assume !(~c~0 < ~k~0); {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:33:02,606 INFO L272 TraceCheckUtils]: 101: Hoare triple {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {7048#true} is VALID [2022-04-08 14:33:02,606 INFO L290 TraceCheckUtils]: 102: Hoare triple {7048#true} ~cond := #in~cond; {7048#true} is VALID [2022-04-08 14:33:02,606 INFO L290 TraceCheckUtils]: 103: Hoare triple {7048#true} assume !(0 == ~cond); {7048#true} is VALID [2022-04-08 14:33:02,606 INFO L290 TraceCheckUtils]: 104: Hoare triple {7048#true} assume true; {7048#true} is VALID [2022-04-08 14:33:02,606 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {7048#true} {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} #59#return; {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 14:33:02,607 INFO L272 TraceCheckUtils]: 106: Hoare triple {7365#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7384#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:02,607 INFO L290 TraceCheckUtils]: 107: Hoare triple {7384#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7388#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:02,608 INFO L290 TraceCheckUtils]: 108: Hoare triple {7388#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7049#false} is VALID [2022-04-08 14:33:02,608 INFO L290 TraceCheckUtils]: 109: Hoare triple {7049#false} assume !false; {7049#false} is VALID [2022-04-08 14:33:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 26 proven. 198 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 14:33:02,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34286682] [2022-04-08 14:33:02,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916727790] [2022-04-08 14:33:02,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916727790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:02,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:02,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 14:33:02,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:02,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1731344337] [2022-04-08 14:33:02,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1731344337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:02,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:02,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 14:33:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046624889] [2022-04-08 14:33:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-08 14:33:02,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:02,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 14:33:02,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:02,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 14:33:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 14:33:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:33:02,913 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 14:33:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:04,301 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-04-08 14:33:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 14:33:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 110 [2022-04-08 14:33:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 14:33:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-08 14:33:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 14:33:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2022-04-08 14:33:04,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2022-04-08 14:33:04,375 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 14:33:04,377 INFO L225 Difference]: With dead ends: 72 [2022-04-08 14:33:04,377 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 14:33:04,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:33:04,378 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:04,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 535 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 14:33:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 14:33:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-08 14:33:04,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:04,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:04,440 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:04,440 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:04,441 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 14:33:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 14:33:04,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:04,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:04,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 14:33:04,442 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 14:33:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:04,443 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-08 14:33:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 14:33:04,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:04,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:04,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:04,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 19 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:33:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-04-08 14:33:04,445 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 110 [2022-04-08 14:33:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:04,445 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-04-08 14:33:04,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 14 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-04-08 14:33:04,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 79 transitions. [2022-04-08 14:33:06,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 78 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-04-08 14:33:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 14:33:06,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:06,749 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:06,769 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 14:33:06,963 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 14:33:06,963 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 23 times [2022-04-08 14:33:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:06,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324909230] [2022-04-08 14:33:06,964 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:33:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1600671149, now seen corresponding path program 24 times [2022-04-08 14:33:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:06,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115027829] [2022-04-08 14:33:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:06,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:06,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996420068] [2022-04-08 14:33:06,978 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:06,979 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 14:33:06,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process