/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/ps4-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:22:27,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:22:27,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:22:27,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:22:27,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:22:27,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:22:27,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:22:27,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:22:27,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:22:27,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:22:27,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:22:27,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:22:27,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:22:27,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:22:27,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:22:27,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:22:27,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:22:27,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:22:27,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:22:27,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:22:27,371 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:22:27,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:22:27,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:22:27,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:22:27,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:22:27,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:22:27,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:22:27,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:22:27,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:22:27,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:22:27,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:22:27,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:22:27,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:22:27,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:22:27,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:22:27,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:22:27,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:22:27,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:22:27,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:22:27,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:22:27,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:22:27,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:22:27,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:22:27,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:22:27,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:22:27,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:22:27,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:22:27,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:22:27,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:22:27,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:22:27,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:22:27,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:22:27,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:22:27,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:22:27,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:22:27,402 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:22:27,403 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:22:27,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:22:27,403 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:22:27,403 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 14:22:27,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:22:27,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:22:27,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:22:27,599 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:22:27,600 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:22:27,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-04-28 14:22:27,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aee95556/56cfe0e2207f42bc93567bdcb6053425/FLAGa18cb8b46 [2022-04-28 14:22:27,989 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:22:27,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-04-28 14:22:27,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aee95556/56cfe0e2207f42bc93567bdcb6053425/FLAGa18cb8b46 [2022-04-28 14:22:28,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aee95556/56cfe0e2207f42bc93567bdcb6053425 [2022-04-28 14:22:28,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:22:28,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:22:28,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:22:28,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:22:28,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:22:28,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2fea23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28, skipping insertion in model container [2022-04-28 14:22:28,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:22:28,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:22:28,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2022-04-28 14:22:28,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:22:28,169 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:22:28,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2022-04-28 14:22:28,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:22:28,218 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:22:28,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28 WrapperNode [2022-04-28 14:22:28,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:22:28,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:22:28,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:22:28,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:22:28,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:22:28,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:22:28,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:22:28,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:22:28,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (1/1) ... [2022-04-28 14:22:28,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:22:28,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:28,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 14:22:28,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 14:22:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:22:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:22:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:22:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:22:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:22:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:22:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:22:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:22:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:22:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:22:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:22:28,402 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:22:28,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:22:28,485 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:22:28,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:22:28,490 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:22:28,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:22:28 BoogieIcfgContainer [2022-04-28 14:22:28,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:22:28,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:22:28,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:22:28,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:22:28,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:22:28" (1/3) ... [2022-04-28 14:22:28,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d5d7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:22:28, skipping insertion in model container [2022-04-28 14:22:28,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:22:28" (2/3) ... [2022-04-28 14:22:28,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d5d7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:22:28, skipping insertion in model container [2022-04-28 14:22:28,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:22:28" (3/3) ... [2022-04-28 14:22:28,496 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2022-04-28 14:22:28,505 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:22:28,505 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:22:28,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:22:28,597 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@257df677, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d653394 [2022-04-28 14:22:28,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:22:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:22:28,610 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:28,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:28,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 14:22:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:28,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146744869] [2022-04-28 14:22:28,632 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:22:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 14:22:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:28,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427362257] [2022-04-28 14:22:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:22:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:28,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(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); {31#true} is VALID [2022-04-28 14:22:28,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 14:22:28,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 14:22:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:22:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:28,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 14:22:28,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 14:22:28,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 14:22:28,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 14:22:28,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:22:28,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(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); {31#true} is VALID [2022-04-28 14:22:28,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 14:22:28,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 14:22:28,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 14:22:28,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-28 14:22:28,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {31#true} is VALID [2022-04-28 14:22:28,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 14:22:28,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 14:22:28,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 14:22:28,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 14:22:28,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-28 14:22:28,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 14:22:28,756 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-28 14:22:28,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 14:22:28,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 14:22:28,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 14:22:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:22:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:28,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427362257] [2022-04-28 14:22:28,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427362257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:28,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:28,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:22:28,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:28,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146744869] [2022-04-28 14:22:28,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146744869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:28,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:28,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:22:28,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885755023] [2022-04-28 14:22:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:22:28,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:28,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:28,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:28,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:22:28,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:22:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:22:28,809 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:28,908 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 14:22:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:22:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:22:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 14:22:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 14:22:28,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 14:22:28,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:28,979 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:22:28,980 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 14:22:28,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:22:28,983 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:28,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:22:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 14:22:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 14:22:29,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:29,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:29,003 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:29,003 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,006 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 14:22:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:22:29,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:29,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:29,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-28 14:22:29,007 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-28 14:22:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,009 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 14:22:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:22:29,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:29,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:29,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:29,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 14:22:29,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 14:22:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:29,013 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 14:22:29,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:29,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 14:22:29,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 14:22:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 14:22:29,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:29,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:29,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:22:29,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 14:22:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:29,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412426407] [2022-04-28 14:22:29,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:22:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 14:22:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:29,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074545764] [2022-04-28 14:22:29,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:29,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:29,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068139515] [2022-04-28 14:22:29,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:29,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:29,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 14:22:29,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:22:29,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:29,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:22:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:29,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:29,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 14:22:29,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-28 14:22:29,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 14:22:29,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 14:22:29,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 14:22:29,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-28 14:22:29,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {229#true} is VALID [2022-04-28 14:22:29,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 14:22:29,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 14:22:29,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 14:22:29,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 14:22:29,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:29,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:29,217 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:29,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:29,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 14:22:29,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 14:22:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:22:29,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:22:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:29,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074545764] [2022-04-28 14:22:29,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:29,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068139515] [2022-04-28 14:22:29,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068139515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:29,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:29,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:22:29,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:29,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412426407] [2022-04-28 14:22:29,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412426407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:29,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:29,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:22:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832147326] [2022-04-28 14:22:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:29,221 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:22:29,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:29,221 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:29,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:29,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:22:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:22:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:22:29,234 INFO L87 Difference]: Start difference. First operand 23 states and 25 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,558 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 14:22:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:22:29,558 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 14:22:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:29,558 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:22:29,560 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 14:22:29,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 14:22:29,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:29,594 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:22:29,595 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 14:22:29,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:22:29,596 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:29,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:22:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 14:22:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 14:22:29,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:29,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:29,605 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:29,605 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,607 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 14:22:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:22:29,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:29,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:29,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 14:22:29,608 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 14:22:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:29,609 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 14:22:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:22:29,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:29,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:29,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:29,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 14:22:29,611 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 14:22:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:29,612 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 14:22:29,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 14:22:29,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 14:22:29,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 14:22:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 14:22:29,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:29,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:29,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:29,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:29,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 14:22:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:29,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082112028] [2022-04-28 14:22:30,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:30,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 14:22:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:30,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444726353] [2022-04-28 14:22:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:30,050 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:30,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356322562] [2022-04-28 14:22:30,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:30,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:30,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:30,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:30,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 14:22:30,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:30,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:30,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:22:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:30,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:30,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 14:22:30,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 14:22:30,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:30,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 14:22:30,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 14:22:30,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 14:22:30,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {474#true} is VALID [2022-04-28 14:22:30,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:30,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:30,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:30,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 14:22:30,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:30,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:30,223 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-28 14:22:30,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:30,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:30,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:30,224 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:30,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-28 14:22:30,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-28 14:22:30,226 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:30,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:30,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 14:22:30,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 14:22:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:22:30,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:30,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 14:22:30,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 14:22:30,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:30,372 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:30,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:22:30,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:22:30,380 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:22:30,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:30,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:30,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:30,380 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-28 14:22:30,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:22:30,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 14:22:30,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 14:22:30,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:30,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 14:22:30,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 14:22:30,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {474#true} is VALID [2022-04-28 14:22:30,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-28 14:22:30,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 14:22:30,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 14:22:30,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 14:22:30,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-28 14:22:30,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 14:22:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 14:22:30,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:30,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444726353] [2022-04-28 14:22:30,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:30,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356322562] [2022-04-28 14:22:30,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356322562] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:30,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:30,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:22:30,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:30,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082112028] [2022-04-28 14:22:30,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082112028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:30,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:30,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:22:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798201334] [2022-04-28 14:22:30,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:30,384 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 14:22:30,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:30,385 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:22:30,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:30,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:22:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:30,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:22:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:22:30,407 INFO L87 Difference]: Start difference. First operand 30 states and 32 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:22:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:30,497 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 14:22:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:22:30,497 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 14:22:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:30,497 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:22:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 14:22:30,498 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:22:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 14:22:30,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 14:22:30,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:30,553 INFO L225 Difference]: With dead ends: 36 [2022-04-28 14:22:30,553 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 14:22:30,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:22:30,558 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:30,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:22:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 14:22:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 14:22:30,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:30,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:30,572 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:30,572 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:30,575 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 14:22:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:22:30,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:30,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:30,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 14:22:30,580 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-28 14:22:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:30,581 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 14:22:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:22:30,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:30,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:30,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:30,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:22:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 14:22:30,583 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-28 14:22:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:30,583 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 14:22:30,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 14:22:30,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 14:22:30,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 14:22:30,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 14:22:30,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:30,635 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:30,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:30,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 14:22:30,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-28 14:22:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:30,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329856302] [2022-04-28 14:22:30,966 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:30,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-28 14:22:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:30,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141889282] [2022-04-28 14:22:30,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:30,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:30,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45967410] [2022-04-28 14:22:30,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:30,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:30,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:31,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 14:22:31,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:31,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:31,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:22:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:31,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:31,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-28 14:22:31,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#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); {822#true} is VALID [2022-04-28 14:22:31,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:31,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-28 14:22:31,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-28 14:22:31,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#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; {822#true} is VALID [2022-04-28 14:22:31,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {822#true} is VALID [2022-04-28 14:22:31,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:22:31,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:22:31,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:31,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-28 14:22:31,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:31,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:31,269 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-28 14:22:31,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:22:31,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:22:31,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:31,271 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:31,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:22:31,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:22:31,272 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-28 14:22:31,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-28 14:22:31,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-28 14:22:31,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-28 14:22:31,273 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 14:22:31,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 14:22:31,274 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:31,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:31,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-28 14:22:31,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-28 14:22:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 14:22:31,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141889282] [2022-04-28 14:22:31,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45967410] [2022-04-28 14:22:31,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45967410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:31,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:31,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 14:22:31,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:31,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329856302] [2022-04-28 14:22:31,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329856302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:31,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:31,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:22:31,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459021131] [2022-04-28 14:22:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:31,553 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 14:22:31,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:31,554 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:22:31,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:22:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:31,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:22:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:22:31,573 INFO L87 Difference]: Start difference. First operand 31 states and 31 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:22:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:31,735 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-28 14:22:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:22:31,735 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 14:22:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:31,735 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:22:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 14:22:31,736 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:22:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-28 14:22:31,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-28 14:22:31,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:31,762 INFO L225 Difference]: With dead ends: 39 [2022-04-28 14:22:31,763 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 14:22:31,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:22:31,763 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:31,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:22:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 14:22:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 14:22:31,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:31,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:31,777 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:31,778 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:31,779 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 14:22:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:22:31,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:31,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:31,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 14:22:31,780 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 14:22:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:31,781 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 14:22:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:22:31,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:31,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:31,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:31,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 14:22:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-28 14:22:31,782 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-28 14:22:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:31,782 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-28 14:22:31,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 14:22:31,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-28 14:22:31,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-28 14:22:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:22:31,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:31,820 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:31,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:32,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:32,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-28 14:22:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:32,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988818523] [2022-04-28 14:22:32,139 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:32,139 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-28 14:22:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:32,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546634132] [2022-04-28 14:22:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:32,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075613659] [2022-04-28 14:22:32,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:32,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:32,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 14:22:32,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:32,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:32,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:22:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:32,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:32,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-28 14:22:32,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#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); {1178#true} is VALID [2022-04-28 14:22:32,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:32,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#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; {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:32,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-28 14:22:32,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:32,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:32,570 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:22:32,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:32,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:32,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:32,571 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:32,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:22:32,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:22:32,572 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:22:32,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-28 14:22:32,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-28 14:22:32,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-28 14:22:32,573 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 14:22:32,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:22:32,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:22:32,574 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-28 14:22:32,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:32,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:22:32,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 14:22:32,575 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} #54#return; {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 14:22:32,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 14:22:32,576 INFO L272 TraceCheckUtils]: 33: Hoare triple {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:32,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:32,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-28 14:22:32,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-28 14:22:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 14:22:32,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:47,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546634132] [2022-04-28 14:22:47,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:47,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075613659] [2022-04-28 14:22:47,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075613659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:47,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:47,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:22:47,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:47,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988818523] [2022-04-28 14:22:47,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988818523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:47,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:47,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:22:47,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617254239] [2022-04-28 14:22:47,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:47,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 14:22:47,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:47,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:47,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:47,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:22:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:22:47,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:22:47,158 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:47,576 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-04-28 14:22:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:22:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 14:22:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 14:22:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-28 14:22:47,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-28 14:22:47,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:47,627 INFO L225 Difference]: With dead ends: 46 [2022-04-28 14:22:47,627 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 14:22:47,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:22:47,628 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:47,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:22:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 14:22:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 14:22:47,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:47,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:47,650 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:47,650 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:47,651 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-28 14:22:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 14:22:47,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:47,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:47,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-28 14:22:47,653 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-28 14:22:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:47,655 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-28 14:22:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 14:22:47,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:47,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:47,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:47,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 14:22:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-28 14:22:47,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2022-04-28 14:22:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:47,660 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-28 14:22:47,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 14:22:47,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-28 14:22:47,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-28 14:22:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:22:47,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:47,728 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:47,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:47,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:47,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-28 14:22:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:47,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1514694999] [2022-04-28 14:22:48,037 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:48,038 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-28 14:22:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:48,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604183322] [2022-04-28 14:22:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:48,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:48,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001537852] [2022-04-28 14:22:48,070 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:48,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:48,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:48,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 14:22:48,147 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 14:22:48,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:48,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 14:22:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:48,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:48,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {1605#true} call ULTIMATE.init(); {1605#true} is VALID [2022-04-28 14:22:48,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#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); {1605#true} is VALID [2022-04-28 14:22:48,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#true} {1605#true} #60#return; {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#true} call #t~ret5 := main(); {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#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; {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:22:48,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#true} {1605#true} #52#return; {1605#true} is VALID [2022-04-28 14:22:48,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1605#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:48,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:48,473 INFO L272 TraceCheckUtils]: 13: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:22:48,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:22:48,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:22:48,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:22:48,474 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1605#true} {1643#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:48,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:48,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:48,475 INFO L272 TraceCheckUtils]: 20: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:22:48,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:22:48,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:22:48,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:22:48,475 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1605#true} {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 14:22:48,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,476 INFO L272 TraceCheckUtils]: 27: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:22:48,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:22:48,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:22:48,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:22:48,479 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1605#true} {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:48,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:48,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:48,480 INFO L272 TraceCheckUtils]: 34: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-28 14:22:48,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-28 14:22:48,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-28 14:22:48,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-28 14:22:48,481 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1605#true} {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:48,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 14:22:48,482 INFO L272 TraceCheckUtils]: 40: Hoare triple {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:48,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:48,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {1739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1606#false} is VALID [2022-04-28 14:22:48,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {1606#false} assume !false; {1606#false} is VALID [2022-04-28 14:22:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 14:22:48,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:48,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604183322] [2022-04-28 14:22:48,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:48,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001537852] [2022-04-28 14:22:48,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001537852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:48,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:48,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 14:22:48,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1514694999] [2022-04-28 14:22:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1514694999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:48,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:48,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:22:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239617681] [2022-04-28 14:22:48,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:48,705 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-28 14:22:48,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:48,705 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:22:48,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:48,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:22:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:22:48,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:22:48,729 INFO L87 Difference]: Start difference. First operand 41 states and 42 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:22:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:48,989 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-28 14:22:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:22:48,990 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-28 14:22:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:48,990 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:22:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:22:48,991 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:22:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 14:22:48,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 14:22:49,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:49,021 INFO L225 Difference]: With dead ends: 49 [2022-04-28 14:22:49,021 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 14:22:49,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:22:49,022 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:49,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:22:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 14:22:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 14:22:49,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:49,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:49,045 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:49,045 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:49,047 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:22:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:22:49,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:49,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:49,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 14:22:49,048 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 14:22:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:49,050 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 14:22:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:22:49,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:49,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:49,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:49,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 14:22:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 14:22:49,051 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 44 [2022-04-28 14:22:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:49,052 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 14:22:49,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 14:22:49,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 14:22:49,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 14:22:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 14:22:49,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:49,103 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:49,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:49,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:49,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-28 14:22:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022668702] [2022-04-28 14:22:49,360 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:49,360 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-28 14:22:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:49,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898312165] [2022-04-28 14:22:49,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:49,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622737229] [2022-04-28 14:22:49,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:22:49,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:49,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:49,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:49,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 14:22:49,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:22:49,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:49,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 14:22:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:49,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:49,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-28 14:22:49,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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); {2065#true} is VALID [2022-04-28 14:22:49,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #60#return; {2065#true} is VALID [2022-04-28 14:22:49,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret5 := main(); {2065#true} is VALID [2022-04-28 14:22:49,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#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; {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #52#return; {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:49,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:49,685 INFO L272 TraceCheckUtils]: 13: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:22:49,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:22:49,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:22:49,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,686 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2103#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:49,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:49,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:49,687 INFO L272 TraceCheckUtils]: 20: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:22:49,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:22:49,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:22:49,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,687 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2065#true} {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 14:22:49,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:49,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:49,688 INFO L272 TraceCheckUtils]: 27: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:22:49,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:22:49,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:22:49,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,688 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2065#true} {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 14:22:49,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {2147#(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 + ~x~0; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 14:22:49,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 14:22:49,689 INFO L272 TraceCheckUtils]: 34: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:22:49,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:22:49,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:22:49,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,690 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2065#true} {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-28 14:22:49,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {2169#(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 + ~x~0; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:22:49,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:22:49,690 INFO L272 TraceCheckUtils]: 41: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 14:22:49,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 14:22:49,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 14:22:49,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 14:22:49,695 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2065#true} {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 14:22:49,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 14:22:49,696 INFO L272 TraceCheckUtils]: 47: Hoare triple {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:49,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:49,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {2221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 14:22:49,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 14:22:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 14:22:49,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898312165] [2022-04-28 14:22:49,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622737229] [2022-04-28 14:22:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622737229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:49,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:49,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 14:22:49,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022668702] [2022-04-28 14:22:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022668702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:49,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:49,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:22:49,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685498680] [2022-04-28 14:22:49,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:49,889 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-28 14:22:49,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:49,889 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:22:49,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:49,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:22:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:49,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:22:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:22:49,914 INFO L87 Difference]: Start difference. First operand 44 states and 46 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:22:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:50,281 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-28 14:22:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:22:50,282 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-28 14:22:50,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:50,282 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:22:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 14:22:50,283 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:22:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 14:22:50,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 14:22:50,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:50,316 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:22:50,316 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:22:50,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:22:50,316 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:50,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:22:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:22:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 14:22:50,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:50,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:50,341 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:50,341 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:50,342 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 14:22:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 14:22:50,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:50,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:50,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 14:22:50,343 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 14:22:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:50,344 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 14:22:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 14:22:50,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:50,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:50,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:50,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:22:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-28 14:22:50,346 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-04-28 14:22:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:50,346 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-28 14:22:50,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 14:22:50,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-28 14:22:50,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 14:22:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 14:22:50,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:50,403 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:50,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 14:22:50,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:50,603 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-28 14:22:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:50,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824781416] [2022-04-28 14:22:50,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:50,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-28 14:22:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:50,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268656782] [2022-04-28 14:22:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:50,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:50,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876815165] [2022-04-28 14:22:50,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:22:50,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:50,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 14:22:50,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:22:50,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:50,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:22:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:50,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:51,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#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); {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #60#return; {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret5 := main(); {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {2565#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; {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {2565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2565#true} {2565#true} #52#return; {2565#true} is VALID [2022-04-28 14:22:51,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {2565#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:51,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:51,056 INFO L272 TraceCheckUtils]: 13: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,056 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2565#true} {2603#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:22:51,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:51,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:51,057 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,057 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2565#true} {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 14:22:51,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:51,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:51,058 INFO L272 TraceCheckUtils]: 27: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,058 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2565#true} {2647#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 14:22:51,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:51,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:51,059 INFO L272 TraceCheckUtils]: 34: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,060 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2565#true} {2669#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 14:22:51,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:51,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:51,060 INFO L272 TraceCheckUtils]: 41: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,061 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2565#true} {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 14:22:51,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:51,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !false; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:51,062 INFO L272 TraceCheckUtils]: 48: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-28 14:22:51,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-28 14:22:51,062 INFO L290 TraceCheckUtils]: 50: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-28 14:22:51,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-28 14:22:51,062 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2565#true} {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #54#return; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:51,063 INFO L290 TraceCheckUtils]: 53: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 14:22:51,063 INFO L272 TraceCheckUtils]: 54: Hoare triple {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:22:51,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:22:51,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {2743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2566#false} is VALID [2022-04-28 14:22:51,064 INFO L290 TraceCheckUtils]: 57: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2022-04-28 14:22:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 14:22:51,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:22:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268656782] [2022-04-28 14:22:51,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:51,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876815165] [2022-04-28 14:22:51,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876815165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 14:22:51,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:22:51,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 14:22:51,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:51,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1824781416] [2022-04-28 14:22:51,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1824781416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:51,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:51,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:22:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586752861] [2022-04-28 14:22:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:51,369 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 14:22:51,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:51,370 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:22:51,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:51,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:22:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:22:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:22:51,389 INFO L87 Difference]: Start difference. First operand 47 states and 50 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:22:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:51,704 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-28 14:22:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:22:51,705 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-28 14:22:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:51,705 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:22:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 14:22:51,706 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:22:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-28 14:22:51,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-28 14:22:51,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:51,767 INFO L225 Difference]: With dead ends: 55 [2022-04-28 14:22:51,767 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 14:22:51,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:22:51,768 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:22:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 14:22:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 14:22:51,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:51,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:51,796 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:51,796 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:51,798 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 14:22:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 14:22:51,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:51,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:51,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-28 14:22:51,799 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-28 14:22:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:51,800 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 14:22:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 14:22:51,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:51,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:51,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:51,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 14:22:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 14:22:51,802 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 58 [2022-04-28 14:22:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:51,802 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 14:22:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 14:22:51,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 14:22:51,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 14:22:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 14:22:51,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:22:51,867 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:22:51,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 14:22:52,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:52,068 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:22:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:22:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-28 14:22:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:52,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [448432359] [2022-04-28 14:22:52,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:22:52,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:22:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-28 14:22:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:22:52,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607663968] [2022-04-28 14:22:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:22:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:22:52,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:22:52,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1360636785] [2022-04-28 14:22:52,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:22:52,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:22:52,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:22:52,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 14:22:52,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 14:22:52,270 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 14:22:52,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:22:52,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:22:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:22:52,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:22:52,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {3105#true} call ULTIMATE.init(); {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {3105#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); {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3105#true} {3105#true} #60#return; {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {3105#true} call #t~ret5 := main(); {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {3105#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; {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {3105#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {3105#true} ~cond := #in~cond; {3131#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 14:22:52,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {3131#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3135#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:22:52,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {3135#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3135#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 14:22:52,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3135#(not (= |assume_abort_if_not_#in~cond| 0))} {3105#true} #52#return; {3142#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:52,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {3142#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:22:52,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:22:52,704 INFO L272 TraceCheckUtils]: 13: Hoare triple {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:22:52,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:22:52,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,705 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3105#true} {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-28 14:22:52,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:52,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:52,706 INFO L272 TraceCheckUtils]: 20: Hoare triple {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:22:52,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:22:52,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,707 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3105#true} {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #54#return; {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-28 14:22:52,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:22:52,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:22:52,708 INFO L272 TraceCheckUtils]: 27: Hoare triple {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:22:52,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:22:52,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,708 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3105#true} {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-28 14:22:52,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:22:52,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:22:52,709 INFO L272 TraceCheckUtils]: 34: Hoare triple {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:22:52,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:22:52,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,710 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3105#true} {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-28 14:22:52,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:22:52,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:22:52,711 INFO L272 TraceCheckUtils]: 41: Hoare triple {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:22:52,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:22:52,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,712 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3105#true} {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-28 14:22:52,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:22:52,713 INFO L290 TraceCheckUtils]: 47: Hoare triple {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:22:52,713 INFO L272 TraceCheckUtils]: 48: Hoare triple {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-28 14:22:52,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-28 14:22:52,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-28 14:22:52,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-28 14:22:52,713 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3105#true} {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-28 14:22:52,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {3106#false} assume !false; {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L272 TraceCheckUtils]: 55: Hoare triple {3106#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {3106#false} ~cond := #in~cond; {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {3106#false} assume !(0 == ~cond); {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {3106#false} assume true; {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3106#false} {3106#false} #54#return; {3106#false} is VALID [2022-04-28 14:22:52,714 INFO L290 TraceCheckUtils]: 60: Hoare triple {3106#false} assume !(~c~0 < ~k~0); {3106#false} is VALID [2022-04-28 14:22:52,715 INFO L272 TraceCheckUtils]: 61: Hoare triple {3106#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3106#false} is VALID [2022-04-28 14:22:52,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {3106#false} ~cond := #in~cond; {3106#false} is VALID [2022-04-28 14:22:52,715 INFO L290 TraceCheckUtils]: 63: Hoare triple {3106#false} assume 0 == ~cond; {3106#false} is VALID [2022-04-28 14:22:52,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {3106#false} assume !false; {3106#false} is VALID [2022-04-28 14:22:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-28 14:22:52,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:22:52,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:22:52,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607663968] [2022-04-28 14:22:52,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:22:52,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360636785] [2022-04-28 14:22:52,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360636785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:52,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:52,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:22:52,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:22:52,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [448432359] [2022-04-28 14:22:52,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [448432359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:22:52,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:22:52,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:22:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104299419] [2022-04-28 14:22:52,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:22:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-28 14:22:52,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:22:52,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:22:52,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:52,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:22:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:22:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:22:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:22:52,748 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:22:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:52,945 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 14:22:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:22:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-28 14:22:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:22:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:22:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-28 14:22:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:22:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-28 14:22:52,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-28 14:22:52,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:52,981 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:22:52,981 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:22:52,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:22:52,982 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:22:52,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:22:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:22:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:22:52,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:22:52,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:52,983 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:52,983 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:52,983 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:22:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:22:52,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:52,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:52,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:22:52,983 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:22:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:22:52,983 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:22:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:22:52,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:52,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:22:52,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:22:52,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:22:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:22:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:22:52,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2022-04-28 14:22:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:22:52,984 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:22:52,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:22:52,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:22:52,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:22:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:22:52,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:22:52,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:22:52,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 14:22:53,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 14:22:53,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:22:53,771 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 14:22:53,772 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 14:22:53,772 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 14:22:53,772 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:22:53,772 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-28 14:22:53,772 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)))) [2022-04-28 14:22:53,772 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 14:22:53,772 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-28 14:22:53,772 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 14:22:53,773 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:22:53,774 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:22:53,774 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:22:53,774 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:22:53,774 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:22:53,783 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2] [2022-04-28 14:22:53,784 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:22:53,786 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:22:53,800 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:22:53,827 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:22:53,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:22:53 BoogieIcfgContainer [2022-04-28 14:22:53,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:22:53,839 INFO L158 Benchmark]: Toolchain (without parser) took 25829.12ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 135.0MB in the beginning and 166.1MB in the end (delta: -31.1MB). Peak memory consumption was 99.1MB. Max. memory is 8.0GB. [2022-04-28 14:22:53,839 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:22:53,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.81ms. Allocated memory is still 181.4MB. Free memory was 134.7MB in the beginning and 159.1MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 14:22:53,840 INFO L158 Benchmark]: Boogie Preprocessor took 21.05ms. Allocated memory is still 181.4MB. Free memory was 159.1MB in the beginning and 157.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 14:22:53,840 INFO L158 Benchmark]: RCFGBuilder took 250.37ms. Allocated memory is still 181.4MB. Free memory was 157.6MB in the beginning and 146.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:22:53,840 INFO L158 Benchmark]: TraceAbstraction took 25346.23ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 146.5MB in the beginning and 166.1MB in the end (delta: -19.5MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. [2022-04-28 14:22:53,841 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.81ms. Allocated memory is still 181.4MB. Free memory was 134.7MB in the beginning and 159.1MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.05ms. Allocated memory is still 181.4MB. Free memory was 159.1MB in the beginning and 157.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.37ms. Allocated memory is still 181.4MB. Free memory was 157.6MB in the beginning and 146.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25346.23ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 146.5MB in the beginning and 166.1MB in the end (delta: -19.5MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 1189 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 941 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 248 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 334 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=8, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 136 PreInvPairs, 204 NumberOfFragments, 853 HoareAnnotationTreeSize, 136 FomulaSimplifications, 273 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 187 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((k <= 5 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((c <= 5 && k <= 5) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 5 <= c) && 4 < k)) || ((((k <= 5 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 5 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3)) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:22:53,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...